/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:16:10,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:16:10,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:16:10,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:16:10,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:16:10,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:16:10,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:16:10,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:16:10,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:16:10,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:16:10,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:16:10,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:16:10,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:16:10,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:16:10,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:16:10,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:16:10,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:16:10,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:16:10,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:16:10,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:16:10,184 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:16:10,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:16:10,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:16:10,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:16:10,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:16:10,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:16:10,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:16:10,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:16:10,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:16:10,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:16:10,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:16:10,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:16:10,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:16:10,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:16:10,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:16:10,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:16:10,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:16:10,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:16:10,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:16:10,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:16:10,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:16:10,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:16:10,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:16:10,218 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:16:10,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:16:10,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:16:10,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:16:10,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:16:10,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:16:10,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:16:10,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:16:10,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:16:10,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:16:10,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:16:10,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:16:10,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:16:10,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:16:10,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:16:10,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:10,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:16:10,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:16:10,222 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:16:10,222 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:16:10,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:16:10,223 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:16:10,223 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:16:10,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:16:10,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:16:10,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:16:10,447 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:16:10,450 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:16:10,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_4.i [2022-04-15 12:16:10,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea97d8f40/e2a767f0581d4d10a099d008fe01e50f/FLAG7332acc9d [2022-04-15 12:16:10,923 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:16:10,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_4.i [2022-04-15 12:16:10,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea97d8f40/e2a767f0581d4d10a099d008fe01e50f/FLAG7332acc9d [2022-04-15 12:16:11,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea97d8f40/e2a767f0581d4d10a099d008fe01e50f [2022-04-15 12:16:11,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:16:11,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:16:11,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:11,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:16:11,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:16:11,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63eff6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11, skipping insertion in model container [2022-04-15 12:16:11,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:16:11,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:16:11,534 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_4.i[848,861] [2022-04-15 12:16:11,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:11,557 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:16:11,571 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_4.i[848,861] [2022-04-15 12:16:11,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:11,590 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:16:11,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11 WrapperNode [2022-04-15 12:16:11,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:11,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:16:11,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:16:11,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:16:11,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:16:11,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:16:11,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:16:11,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:16:11,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (1/1) ... [2022-04-15 12:16:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:11,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:11,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:16:11,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:16:11,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:16:11,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:16:11,700 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:16:11,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:16:11,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:16:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:16:11,758 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:16:11,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:16:11,866 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:16:11,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:16:11,872 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:16:11,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:11 BoogieIcfgContainer [2022-04-15 12:16:11,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:16:11,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:16:11,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:16:11,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:16:11,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:16:11" (1/3) ... [2022-04-15 12:16:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c047e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:11, skipping insertion in model container [2022-04-15 12:16:11,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:11" (2/3) ... [2022-04-15 12:16:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c047e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:11, skipping insertion in model container [2022-04-15 12:16:11,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:11" (3/3) ... [2022-04-15 12:16:11,904 INFO L111 eAbstractionObserver]: Analyzing ICFG array_4.i [2022-04-15 12:16:11,908 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:16:11,909 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:16:11,939 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:16:11,945 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:16:11,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:16:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:16:11,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:11,992 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:11,993 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash -615726646, now seen corresponding path program 1 times [2022-04-15 12:16:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:12,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209951846] [2022-04-15 12:16:12,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash -615726646, now seen corresponding path program 2 times [2022-04-15 12:16:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:12,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510008615] [2022-04-15 12:16:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:12,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-15 12:16:12,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:16:12,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 12:16:12,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:12,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-15 12:16:12,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 12:16:12,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 12:16:12,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 12:16:12,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27#true} is VALID [2022-04-15 12:16:12,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 12:16:12,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28#false} is VALID [2022-04-15 12:16:12,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-15 12:16:12,180 INFO L272 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28#false} is VALID [2022-04-15 12:16:12,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 12:16:12,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 12:16:12,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 12:16:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:12,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510008615] [2022-04-15 12:16:12,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510008615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:12,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:12,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:12,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:12,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209951846] [2022-04-15 12:16:12,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209951846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:12,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:12,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289419394] [2022-04-15 12:16:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:12,191 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-15 12:16:12,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:12,195 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-15 12:16:12,212 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-15 12:16:12,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:16:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:12,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:16:12,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:12,235 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-15 12:16:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,342 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 12:16:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:16:12,343 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-15 12:16:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:12,345 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-15 12:16:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 12:16:12,360 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-15 12:16:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 12:16:12,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 12:16:12,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:12,447 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:16:12,448 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:16:12,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:12,457 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:12,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:16:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:16:12,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:12,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,499 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,499 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,503 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:16:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:16:12,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:12,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:12,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:16:12,504 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:16:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,511 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:16:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:16:12,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:12,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:12,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:12,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 12:16:12,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-15 12:16:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:12,515 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 12:16:12,517 INFO L479 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-15 12:16:12,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-15 12:16:12,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:16:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:16:12,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:12,574 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:12,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:16:12,574 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 238110415, now seen corresponding path program 1 times [2022-04-15 12:16:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:12,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213499072] [2022-04-15 12:16:12,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 238110415, now seen corresponding path program 2 times [2022-04-15 12:16:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:12,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558459921] [2022-04-15 12:16:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:12,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {183#true} is VALID [2022-04-15 12:16:12,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 12:16:12,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 12:16:12,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:12,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {183#true} is VALID [2022-04-15 12:16:12,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 12:16:12,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 12:16:12,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret5 := main(); {183#true} is VALID [2022-04-15 12:16:12,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {188#(= main_~i~0 0)} is VALID [2022-04-15 12:16:12,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(= main_~i~0 0)} assume !(~i~0 < 1023); {184#false} is VALID [2022-04-15 12:16:12,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {184#false} is VALID [2022-04-15 12:16:12,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {184#false} is VALID [2022-04-15 12:16:12,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} assume !(0 != #t~mem4);havoc #t~mem4; {184#false} is VALID [2022-04-15 12:16:12,687 INFO L272 TraceCheckUtils]: 10: Hoare triple {184#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {184#false} is VALID [2022-04-15 12:16:12,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-04-15 12:16:12,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume 0 == ~cond; {184#false} is VALID [2022-04-15 12:16:12,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-15 12:16:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:12,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558459921] [2022-04-15 12:16:12,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558459921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:12,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:12,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:12,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:12,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213499072] [2022-04-15 12:16:12,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213499072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:12,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:12,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734743834] [2022-04-15 12:16:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:16:12,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:12,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:12,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:16:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:16:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:16:12,711 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,796 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 12:16:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:16:12,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:16:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 12:16:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 12:16:12,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-15 12:16:12,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:12,839 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:16:12,839 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:16:12,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:16:12,842 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:12,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:16:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2022-04-15 12:16:12,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:12,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,860 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,860 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,862 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:16:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:16:12,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:12,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:12,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:16:12,863 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:16:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,865 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:16:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:16:12,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:12,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:12,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:12,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-15 12:16:12,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-15 12:16:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:12,868 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-15 12:16:12,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-15 12:16:12,888 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-15 12:16:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:16:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:16:12,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:12,890 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:12,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:16:12,890 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1502803825, now seen corresponding path program 1 times [2022-04-15 12:16:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:12,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [562892854] [2022-04-15 12:16:12,909 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:12,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1502803825, now seen corresponding path program 2 times [2022-04-15 12:16:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:12,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338701179] [2022-04-15 12:16:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {340#true} is VALID [2022-04-15 12:16:13,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 12:16:13,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #58#return; {340#true} is VALID [2022-04-15 12:16:13,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:13,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {340#true} is VALID [2022-04-15 12:16:13,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 12:16:13,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #58#return; {340#true} is VALID [2022-04-15 12:16:13,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-15 12:16:13,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {345#(= main_~i~0 0)} is VALID [2022-04-15 12:16:13,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {345#(= main_~i~0 0)} is VALID [2022-04-15 12:16:13,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {346#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(<= main_~i~0 1)} assume !(~i~0 < 1023); {341#false} is VALID [2022-04-15 12:16:13,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {341#false} is VALID [2022-04-15 12:16:13,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {341#false} is VALID [2022-04-15 12:16:13,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {341#false} assume !(0 != #t~mem4);havoc #t~mem4; {341#false} is VALID [2022-04-15 12:16:13,006 INFO L272 TraceCheckUtils]: 12: Hoare triple {341#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {341#false} is VALID [2022-04-15 12:16:13,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2022-04-15 12:16:13,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume 0 == ~cond; {341#false} is VALID [2022-04-15 12:16:13,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 12:16:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338701179] [2022-04-15 12:16:13,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338701179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637820541] [2022-04-15 12:16:13,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:13,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:13,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:13,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:13,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:16:13,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:16:13,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:13,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:16:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:13,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-15 12:16:13,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {340#true} is VALID [2022-04-15 12:16:13,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 12:16:13,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #58#return; {340#true} is VALID [2022-04-15 12:16:13,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-15 12:16:13,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {340#true} is VALID [2022-04-15 12:16:13,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {340#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {340#true} is VALID [2022-04-15 12:16:13,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {340#true} is VALID [2022-04-15 12:16:13,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#true} assume !(~i~0 < 1023); {340#true} is VALID [2022-04-15 12:16:13,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {378#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {378#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(<= main_~i~0 0)} assume !(0 != #t~mem4);havoc #t~mem4; {378#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,227 INFO L272 TraceCheckUtils]: 12: Hoare triple {378#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:13,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {388#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:13,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {392#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-15 12:16:13,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 12:16:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:16:13,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:16:13,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637820541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:13,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:16:13,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 12:16:13,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [562892854] [2022-04-15 12:16:13,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [562892854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:13,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:13,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:16:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713559749] [2022-04-15 12:16:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-15 12:16:13,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:13,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:13,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:16:13,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:16:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:16:13,247 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:13,343 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-15 12:16:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:16:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-15 12:16:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 12:16:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 12:16:13,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 12:16:13,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:13,377 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:16:13,377 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:16:13,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-15 12:16:13,380 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:13,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:16:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-15 12:16:13,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:13,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,395 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,396 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:13,400 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 12:16:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:16:13,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:13,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:13,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:16:13,401 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:16:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:13,402 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 12:16:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:16:13,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:13,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:13,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:13,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-15 12:16:13,404 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2022-04-15 12:16:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:13,405 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-15 12:16:13,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-15 12:16:13,430 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-15 12:16:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:16:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:16:13,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:13,432 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:13,459 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-15 12:16:13,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:13,645 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1018715970, now seen corresponding path program 1 times [2022-04-15 12:16:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:13,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660988518] [2022-04-15 12:16:13,655 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:13,655 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1018715970, now seen corresponding path program 2 times [2022-04-15 12:16:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:13,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095029750] [2022-04-15 12:16:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {538#true} is VALID [2022-04-15 12:16:13,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:16:13,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 12:16:13,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:13,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {538#true} is VALID [2022-04-15 12:16:13,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:16:13,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 12:16:13,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 12:16:13,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {543#(= main_~i~0 0)} is VALID [2022-04-15 12:16:13,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {543#(= main_~i~0 0)} is VALID [2022-04-15 12:16:13,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {543#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {544#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(<= main_~i~0 1)} assume !(~i~0 < 1023); {539#false} is VALID [2022-04-15 12:16:13,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {539#false} is VALID [2022-04-15 12:16:13,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 12:16:13,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !!(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 12:16:13,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {539#false} is VALID [2022-04-15 12:16:13,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 12:16:13,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#false} assume !(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 12:16:13,715 INFO L272 TraceCheckUtils]: 15: Hoare triple {539#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {539#false} is VALID [2022-04-15 12:16:13,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 12:16:13,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 12:16:13,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 12:16:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:16:13,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:13,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095029750] [2022-04-15 12:16:13,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095029750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:13,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118354104] [2022-04-15 12:16:13,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:13,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:13,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:13,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:13,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:16:13,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:13,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:13,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 12:16:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:13,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 12:16:13,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {538#true} is VALID [2022-04-15 12:16:13,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:16:13,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 12:16:13,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 12:16:13,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {564#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {564#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {564#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {564#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {544#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(<= main_~i~0 1)} assume !(~i~0 < 1023); {539#false} is VALID [2022-04-15 12:16:13,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {539#false} is VALID [2022-04-15 12:16:13,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 12:16:13,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !!(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 12:16:13,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {539#false} is VALID [2022-04-15 12:16:13,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 12:16:13,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#false} assume !(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 12:16:13,856 INFO L272 TraceCheckUtils]: 15: Hoare triple {539#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {539#false} is VALID [2022-04-15 12:16:13,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 12:16:13,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 12:16:13,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 12:16:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:16:13,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:13,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 12:16:13,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 12:16:13,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 12:16:13,973 INFO L272 TraceCheckUtils]: 15: Hoare triple {539#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {539#false} is VALID [2022-04-15 12:16:13,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#false} assume !(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 12:16:13,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 12:16:13,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {539#false} is VALID [2022-04-15 12:16:13,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !!(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 12:16:13,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 12:16:13,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {539#false} is VALID [2022-04-15 12:16:13,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#(< main_~i~0 1023)} assume !(~i~0 < 1023); {539#false} is VALID [2022-04-15 12:16:13,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {638#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {634#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:13,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {638#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:13,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {638#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:13,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 12:16:13,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 12:16:13,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 12:16:13,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {538#true} is VALID [2022-04-15 12:16:13,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 12:16:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:16:13,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118354104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:13,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:13,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 12:16:13,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:13,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660988518] [2022-04-15 12:16:13,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660988518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:13,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:13,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:16:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558740343] [2022-04-15 12:16:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:16:13,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:13,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:14,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:16:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:16:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:16:14,012 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:14,129 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 12:16:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:16:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:16:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 12:16:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 12:16:14,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 12:16:14,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:14,174 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:16:14,174 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:16:14,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 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-15 12:16:14,175 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:14,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:16:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-15 12:16:14,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:14,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,189 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,190 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:14,194 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 12:16:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:16:14,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:14,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:14,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:16:14,195 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:16:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:14,196 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 12:16:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:16:14,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:14,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:14,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:14,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 12:16:14,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2022-04-15 12:16:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:14,198 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 12:16:14,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-15 12:16:14,220 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-15 12:16:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:16:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:16:14,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:14,221 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:14,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:14,434 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 12:16:14,435 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash -706411172, now seen corresponding path program 3 times [2022-04-15 12:16:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:14,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972859838] [2022-04-15 12:16:14,468 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:14,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash -706411172, now seen corresponding path program 4 times [2022-04-15 12:16:14,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:14,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706710362] [2022-04-15 12:16:14,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:14,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:14,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {844#true} is VALID [2022-04-15 12:16:14,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 12:16:14,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 12:16:14,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:14,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {844#true} is VALID [2022-04-15 12:16:14,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 12:16:14,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 12:16:14,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret5 := main(); {844#true} is VALID [2022-04-15 12:16:14,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {844#true} is VALID [2022-04-15 12:16:14,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {844#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {844#true} is VALID [2022-04-15 12:16:14,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {844#true} is VALID [2022-04-15 12:16:14,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {844#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {844#true} is VALID [2022-04-15 12:16:14,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {844#true} is VALID [2022-04-15 12:16:14,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#true} assume !(~i~0 < 1023); {844#true} is VALID [2022-04-15 12:16:14,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {849#(= main_~i~0 0)} is VALID [2022-04-15 12:16:14,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {849#(= main_~i~0 0)} is VALID [2022-04-15 12:16:14,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {849#(= main_~i~0 0)} is VALID [2022-04-15 12:16:14,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {850#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:14,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {850#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {850#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:14,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {850#(<= main_~i~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {850#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:14,548 INFO L272 TraceCheckUtils]: 17: Hoare triple {850#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {851#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:16:14,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {851#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {852#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:16:14,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {845#false} is VALID [2022-04-15 12:16:14,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-15 12:16:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:16:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706710362] [2022-04-15 12:16:14,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706710362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562735923] [2022-04-15 12:16:14,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:14,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:14,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:14,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:16:14,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:14,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:14,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:16:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:14,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2022-04-15 12:16:14,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {844#true} is VALID [2022-04-15 12:16:14,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 12:16:14,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 12:16:14,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret5 := main(); {844#true} is VALID [2022-04-15 12:16:14,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {872#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:14,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {872#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:14,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:14,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {850#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:14,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {885#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:14,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {885#(<= main_~i~0 2)} assume !(~i~0 < 1023); {845#false} is VALID [2022-04-15 12:16:14,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {845#false} is VALID [2022-04-15 12:16:14,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 12:16:14,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !!(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 12:16:14,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {845#false} is VALID [2022-04-15 12:16:14,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 12:16:14,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume !(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 12:16:14,756 INFO L272 TraceCheckUtils]: 17: Hoare triple {845#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {845#false} is VALID [2022-04-15 12:16:14,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-15 12:16:14,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-15 12:16:14,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-15 12:16:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:16:14,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:14,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-15 12:16:14,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-15 12:16:14,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-15 12:16:14,865 INFO L272 TraceCheckUtils]: 17: Hoare triple {845#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {845#false} is VALID [2022-04-15 12:16:14,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume !(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 12:16:14,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 12:16:14,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {845#false} is VALID [2022-04-15 12:16:14,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !!(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 12:16:14,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 12:16:14,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {845#false} is VALID [2022-04-15 12:16:14,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(< main_~i~0 1023)} assume !(~i~0 < 1023); {845#false} is VALID [2022-04-15 12:16:14,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {953#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {949#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:14,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {953#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {953#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:14,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {953#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:14,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {960#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:14,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {960#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:14,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret5 := main(); {844#true} is VALID [2022-04-15 12:16:14,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 12:16:14,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 12:16:14,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {844#true} is VALID [2022-04-15 12:16:14,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2022-04-15 12:16:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:16:14,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562735923] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:14,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:14,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-15 12:16:14,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:14,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972859838] [2022-04-15 12:16:14,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972859838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:14,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:14,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185197574] [2022-04-15 12:16:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:14,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:14,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:14,895 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-15 12:16:14,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:16:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:16:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:16:14,896 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:15,063 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:16:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:16:15,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:16:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:16:15,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 12:16:15,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:15,097 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:16:15,097 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:16:15,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 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-15 12:16:15,098 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:15,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:16:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-15 12:16:15,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:15,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,112 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,112 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:15,113 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-15 12:16:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 12:16:15,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:15,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:15,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:16:15,114 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:16:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:15,115 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-15 12:16:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 12:16:15,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:15,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:15,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:15,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-15 12:16:15,117 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-04-15 12:16:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:15,117 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-15 12:16:15,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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-15 12:16:15,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-15 12:16:15,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:16:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:16:15,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:15,142 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:15,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:15,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:15,355 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 336152307, now seen corresponding path program 5 times [2022-04-15 12:16:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:15,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260172612] [2022-04-15 12:16:15,362 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:15,362 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash 336152307, now seen corresponding path program 6 times [2022-04-15 12:16:15,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:15,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084593526] [2022-04-15 12:16:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:15,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:15,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1162#true} is VALID [2022-04-15 12:16:15,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 12:16:15,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 12:16:15,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:15,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1162#true} is VALID [2022-04-15 12:16:15,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 12:16:15,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 12:16:15,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret5 := main(); {1162#true} is VALID [2022-04-15 12:16:15,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1167#(= main_~i~0 0)} is VALID [2022-04-15 12:16:15,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1167#(= main_~i~0 0)} is VALID [2022-04-15 12:16:15,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1169#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {1169#(<= main_~i~0 2)} assume !(~i~0 < 1023); {1163#false} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {1163#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1163#false} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {1163#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1163#false} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {1163#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1163#false} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1163#false} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {1163#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1163#false} is VALID [2022-04-15 12:16:15,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {1163#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {1163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {1163#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {1163#false} assume !(0 != #t~mem4);havoc #t~mem4; {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L272 TraceCheckUtils]: 20: Hoare triple {1163#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {1163#false} assume 0 == ~cond; {1163#false} is VALID [2022-04-15 12:16:15,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2022-04-15 12:16:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:15,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084593526] [2022-04-15 12:16:15,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084593526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:15,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605201065] [2022-04-15 12:16:15,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:15,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:15,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:15,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:16:15,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:16:15,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:15,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:15,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:15,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2022-04-15 12:16:15,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1162#true} is VALID [2022-04-15 12:16:15,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 12:16:15,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 12:16:15,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret5 := main(); {1162#true} is VALID [2022-04-15 12:16:15,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1162#true} is VALID [2022-04-15 12:16:15,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 12:16:15,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 12:16:15,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 12:16:15,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 12:16:15,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#true} assume !(~i~0 < 1023); {1162#true} is VALID [2022-04-15 12:16:15,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1207#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:15,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:15,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {1207#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {1207#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:15,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {1207#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1168#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {1168#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1169#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1169#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {1169#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,627 INFO L272 TraceCheckUtils]: 20: Hoare triple {1169#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:15,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:15,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1163#false} is VALID [2022-04-15 12:16:15,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2022-04-15 12:16:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:16:15,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:15,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2022-04-15 12:16:15,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1163#false} is VALID [2022-04-15 12:16:15,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:15,787 INFO L272 TraceCheckUtils]: 20: Hoare triple {1255#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:15,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {1255#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {1255#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:15,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1255#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:15,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {1265#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1255#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:15,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {1265#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:15,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1265#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:15,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1265#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:15,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1275#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {1275#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:15,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1275#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1275#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:15,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1275#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:15,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#true} assume !(~i~0 < 1023); {1162#true} is VALID [2022-04-15 12:16:15,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 12:16:15,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret5 := main(); {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 12:16:15,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1162#true} is VALID [2022-04-15 12:16:15,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2022-04-15 12:16:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:16:15,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605201065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:15,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:15,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-04-15 12:16:15,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260172612] [2022-04-15 12:16:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260172612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:15,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:15,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:16:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960889416] [2022-04-15 12:16:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:16:15,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:15,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:15,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:16:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:16:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:16:15,812 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:15,970 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 12:16:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:16:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:16:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 12:16:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 12:16:15,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 12:16:16,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:16,020 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:16:16,020 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:16:16,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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-15 12:16:16,021 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:16,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:16:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-15 12:16:16,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:16,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,041 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,041 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:16,042 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:16:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:16:16,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:16,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:16,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:16:16,043 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:16:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:16,045 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:16:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:16:16,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:16,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:16,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:16,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-15 12:16:16,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2022-04-15 12:16:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:16,047 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-15 12:16:16,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-15 12:16:16,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 12:16:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:16:16,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:16,072 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:16,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:16,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:16,287 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -842525419, now seen corresponding path program 7 times [2022-04-15 12:16:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:16,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515240376] [2022-04-15 12:16:16,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:16,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash -842525419, now seen corresponding path program 8 times [2022-04-15 12:16:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:16,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119825199] [2022-04-15 12:16:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:16,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {1549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1540#true} is VALID [2022-04-15 12:16:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 12:16:16,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 12:16:16,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1540#true} is VALID [2022-04-15 12:16:16,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 12:16:16,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 12:16:16,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret5 := main(); {1540#true} is VALID [2022-04-15 12:16:16,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1545#(= main_~i~0 0)} is VALID [2022-04-15 12:16:16,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {1545#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1545#(= main_~i~0 0)} is VALID [2022-04-15 12:16:16,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1545#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1546#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {1547#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1547#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1548#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:16,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#(<= main_~i~0 3)} assume !(~i~0 < 1023); {1541#false} is VALID [2022-04-15 12:16:16,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1541#false} is VALID [2022-04-15 12:16:16,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#false} is VALID [2022-04-15 12:16:16,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1541#false} is VALID [2022-04-15 12:16:16,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {1541#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {1541#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {1541#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {1541#false} assume !(0 != #t~mem4);havoc #t~mem4; {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L272 TraceCheckUtils]: 22: Hoare triple {1541#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {1541#false} ~cond := #in~cond; {1541#false} is VALID [2022-04-15 12:16:16,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {1541#false} assume 0 == ~cond; {1541#false} is VALID [2022-04-15 12:16:16,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-04-15 12:16:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119825199] [2022-04-15 12:16:16,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119825199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352490991] [2022-04-15 12:16:16,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:16,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:16,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:16:16,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:16,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:16,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:16,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:16,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1540#true} is VALID [2022-04-15 12:16:16,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1540#true} is VALID [2022-04-15 12:16:16,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 12:16:16,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 12:16:16,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret5 := main(); {1540#true} is VALID [2022-04-15 12:16:16,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1540#true} is VALID [2022-04-15 12:16:16,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 12:16:16,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 12:16:16,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 12:16:16,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 12:16:16,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 12:16:16,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 12:16:16,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#true} assume !(~i~0 < 1023); {1540#true} is VALID [2022-04-15 12:16:16,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1592#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:16,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1592#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1592#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:16,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {1592#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {1592#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:16,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1592#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1546#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1546#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1546#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1546#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {1547#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1547#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,588 INFO L272 TraceCheckUtils]: 22: Hoare triple {1547#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:16,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:16,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {1624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1541#false} is VALID [2022-04-15 12:16:16,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-04-15 12:16:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:16:16,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:16,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-04-15 12:16:16,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {1624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1541#false} is VALID [2022-04-15 12:16:16,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:16,760 INFO L272 TraceCheckUtils]: 22: Hoare triple {1640#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:16,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {1640#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {1640#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:16,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1640#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:16,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {1650#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1640#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:16,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1650#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {1650#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:16,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1650#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:16,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1650#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:16,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {1660#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:16,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1660#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:16,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1660#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#true} assume !(~i~0 < 1023); {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 12:16:16,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1540#true} is VALID [2022-04-15 12:16:16,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret5 := main(); {1540#true} is VALID [2022-04-15 12:16:16,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 12:16:16,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 12:16:16,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1540#true} is VALID [2022-04-15 12:16:16,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1540#true} is VALID [2022-04-15 12:16:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:16:16,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352490991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:16,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:16,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-15 12:16:16,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:16,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515240376] [2022-04-15 12:16:16,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515240376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:16,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:16,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:16,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601063672] [2022-04-15 12:16:16,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:16:16,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:16,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:16,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:16:16,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:16,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:16:16,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:16:16,795 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,004 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 12:16:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:16:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:16:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 12:16:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 12:16:17,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-15 12:16:17,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,055 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:16:17,055 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:16:17,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:16:17,056 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:17,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 26 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:16:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-04-15 12:16:17,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:17,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,085 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,085 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,086 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 12:16:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 12:16:17,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:17,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:17,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:16:17,087 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:16:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,088 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 12:16:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 12:16:17,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:17,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:17,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:17,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 12:16:17,090 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2022-04-15 12:16:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:17,091 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 12:16:17,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 12:16:17,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:16:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:16:17,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:17,123 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:17,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:17,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:17,332 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:17,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash 319546039, now seen corresponding path program 9 times [2022-04-15 12:16:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:17,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617881573] [2022-04-15 12:16:17,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:17,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 319546039, now seen corresponding path program 10 times [2022-04-15 12:16:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:17,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166860144] [2022-04-15 12:16:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:17,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1961#true} is VALID [2022-04-15 12:16:17,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 12:16:17,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 12:16:17,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:17,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1961#true} is VALID [2022-04-15 12:16:17,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 12:16:17,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 12:16:17,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret5 := main(); {1961#true} is VALID [2022-04-15 12:16:17,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1966#(= main_~i~0 0)} is VALID [2022-04-15 12:16:17,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {1966#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1966#(= main_~i~0 0)} is VALID [2022-04-15 12:16:17,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1966#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1967#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1968#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:17,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1969#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:17,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1969#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1970#(<= main_~i~0 4)} assume !(~i~0 < 1023); {1962#false} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1962#false} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#false} assume !(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L272 TraceCheckUtils]: 24: Hoare triple {1962#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-04-15 12:16:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:17,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166860144] [2022-04-15 12:16:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166860144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22709824] [2022-04-15 12:16:17,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:17,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:17,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:17,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:17,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:16:17,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:17,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:17,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:17,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:17,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1961#true} is VALID [2022-04-15 12:16:17,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1961#true} is VALID [2022-04-15 12:16:17,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 12:16:17,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 12:16:17,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret5 := main(); {1961#true} is VALID [2022-04-15 12:16:17,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1990#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:17,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {1990#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1990#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:17,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {1990#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1967#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {1968#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:17,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1969#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:17,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {1969#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {1970#(<= main_~i~0 4)} assume !(~i~0 < 1023); {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#false} assume !(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L272 TraceCheckUtils]: 24: Hoare triple {1962#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-04-15 12:16:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:17,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:17,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-04-15 12:16:17,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2022-04-15 12:16:17,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2022-04-15 12:16:17,798 INFO L272 TraceCheckUtils]: 24: Hoare triple {1962#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1962#false} is VALID [2022-04-15 12:16:17,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#false} assume !(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 12:16:17,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1962#false} is VALID [2022-04-15 12:16:17,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#(< main_~i~0 1023)} assume !(~i~0 < 1023); {1962#false} is VALID [2022-04-15 12:16:17,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {2100#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2096#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:17,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {2100#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2100#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:17,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {2107#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2100#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:17,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {2107#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2107#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:17,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {2114#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2107#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:17,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {2114#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2114#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:17,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {2121#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2114#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:17,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {2121#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2121#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:17,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2121#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:17,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret5 := main(); {1961#true} is VALID [2022-04-15 12:16:17,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 12:16:17,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 12:16:17,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1961#true} is VALID [2022-04-15 12:16:17,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1961#true} is VALID [2022-04-15 12:16:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:17,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22709824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:17,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 12:16:17,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:17,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617881573] [2022-04-15 12:16:17,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617881573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:17,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:16:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644573172] [2022-04-15 12:16:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:16:17,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:17,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:16:17,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:17,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:16:17,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:16:17,827 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,114 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 12:16:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:16:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:16:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-15 12:16:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-15 12:16:18,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-04-15 12:16:18,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,204 INFO L225 Difference]: With dead ends: 59 [2022-04-15 12:16:18,204 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:16:18,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 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-15 12:16:18,205 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:18,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 26 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:16:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-15 12:16:18,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:18,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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-15 12:16:18,270 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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-15 12:16:18,271 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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-15 12:16:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,273 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 12:16:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 12:16:18,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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 45 states. [2022-04-15 12:16:18,281 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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 45 states. [2022-04-15 12:16:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,285 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 12:16:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 12:16:18,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:18,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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-15 12:16:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 12:16:18,287 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2022-04-15 12:16:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:18,287 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 12:16:18,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 12:16:18,318 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-15 12:16:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 12:16:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:16:18,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:18,322 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:18,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 12:16:18,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:18,546 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 378720217, now seen corresponding path program 11 times [2022-04-15 12:16:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947465398] [2022-04-15 12:16:18,554 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:18,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash 378720217, now seen corresponding path program 12 times [2022-04-15 12:16:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:18,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514095598] [2022-04-15 12:16:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {2436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2425#true} is VALID [2022-04-15 12:16:18,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 12:16:18,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 12:16:18,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:18,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2425#true} is VALID [2022-04-15 12:16:18,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 12:16:18,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 12:16:18,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret5 := main(); {2425#true} is VALID [2022-04-15 12:16:18,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2430#(= main_~i~0 0)} is VALID [2022-04-15 12:16:18,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {2430#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2430#(= main_~i~0 0)} is VALID [2022-04-15 12:16:18,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:18,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2431#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:18,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {2431#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:18,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {2432#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:18,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {2432#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2433#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:18,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2433#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2433#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:18,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {2433#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2434#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:18,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {2434#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2434#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:18,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {2434#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2435#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {2435#(<= main_~i~0 5)} assume !(~i~0 < 1023); {2426#false} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {2426#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2426#false} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {2426#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2426#false} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {2426#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2426#false} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {2426#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2426#false} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {2426#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2426#false} is VALID [2022-04-15 12:16:18,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {2426#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {2426#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {2426#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {2426#false} assume !(0 != #t~mem4);havoc #t~mem4; {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L272 TraceCheckUtils]: 26: Hoare triple {2426#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {2426#false} ~cond := #in~cond; {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {2426#false} assume 0 == ~cond; {2426#false} is VALID [2022-04-15 12:16:18,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 12:16:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514095598] [2022-04-15 12:16:18,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514095598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56840153] [2022-04-15 12:16:18,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:18,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:18,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:18,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:16:18,880 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:18,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:18,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:19,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2022-04-15 12:16:19,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2425#true} is VALID [2022-04-15 12:16:19,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret5 := main(); {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {2425#true} assume !(~i~0 < 1023); {2425#true} is VALID [2022-04-15 12:16:19,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {2425#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2491#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:19,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {2491#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2491#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:19,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {2491#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {2491#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:19,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {2491#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:19,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {2431#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2431#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:19,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:19,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:19,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {2432#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2432#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:19,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {2432#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:19,052 INFO L272 TraceCheckUtils]: 26: Hoare triple {2432#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:19,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:19,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {2523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2426#false} is VALID [2022-04-15 12:16:19,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 12:16:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:16:19,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:19,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 12:16:19,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {2523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2426#false} is VALID [2022-04-15 12:16:19,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:19,273 INFO L272 TraceCheckUtils]: 26: Hoare triple {2539#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:19,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {2539#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {2539#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:19,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {2539#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2539#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:19,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2539#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:19,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {2549#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:19,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2549#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:19,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {2559#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2549#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:19,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {2559#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:19,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2559#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {2425#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2559#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {2425#true} assume !(~i~0 < 1023); {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret5 := main(); {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2425#true} is VALID [2022-04-15 12:16:19,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2022-04-15 12:16:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:16:19,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56840153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:19,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:19,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-15 12:16:19,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:19,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947465398] [2022-04-15 12:16:19,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947465398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:19,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:19,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:16:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221748743] [2022-04-15 12:16:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:19,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:16:19,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:19,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:16:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:16:19,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:16:19,333 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,167 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 12:16:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:16:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:16:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-04-15 12:16:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-04-15 12:16:20,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2022-04-15 12:16:20,259 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-15 12:16:20,261 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:16:20,261 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:16:20,261 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:16:20,262 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:20,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 46 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:16:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-04-15 12:16:20,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:20,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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-15 12:16:20,301 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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-15 12:16:20,301 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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-15 12:16:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,303 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 12:16:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 12:16:20,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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 51 states. [2022-04-15 12:16:20,304 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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 51 states. [2022-04-15 12:16:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,305 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 12:16:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 12:16:20,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:20,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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-15 12:16:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-15 12:16:20,307 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2022-04-15 12:16:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:20,307 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-15 12:16:20,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-15 12:16:20,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-15 12:16:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:16:20,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:20,349 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:20,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:20,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:20,568 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1410530427, now seen corresponding path program 13 times [2022-04-15 12:16:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:20,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797093607] [2022-04-15 12:16:20,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:20,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1410530427, now seen corresponding path program 14 times [2022-04-15 12:16:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:20,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529690443] [2022-04-15 12:16:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {2944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2932#true} is VALID [2022-04-15 12:16:20,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 12:16:20,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 12:16:20,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:20,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2932#true} is VALID [2022-04-15 12:16:20,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 12:16:20,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 12:16:20,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret5 := main(); {2932#true} is VALID [2022-04-15 12:16:20,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2937#(= main_~i~0 0)} is VALID [2022-04-15 12:16:20,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {2937#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2937#(= main_~i~0 0)} is VALID [2022-04-15 12:16:20,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {2939#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {2940#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2940#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {2941#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {2941#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {2942#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {2942#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2943#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:20,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {2943#(<= main_~i~0 6)} assume !(~i~0 < 1023); {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:20,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:20,747 INFO L272 TraceCheckUtils]: 28: Hoare triple {2933#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2933#false} is VALID [2022-04-15 12:16:20,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-15 12:16:20,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-15 12:16:20,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-15 12:16:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:20,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529690443] [2022-04-15 12:16:20,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529690443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:20,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993689319] [2022-04-15 12:16:20,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:20,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:20,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:20,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:20,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:16:20,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:20,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:20,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:16:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:20,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-15 12:16:20,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2932#true} is VALID [2022-04-15 12:16:20,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 12:16:20,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 12:16:20,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret5 := main(); {2932#true} is VALID [2022-04-15 12:16:20,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2963#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:20,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {2963#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2963#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:20,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {2963#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {2939#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {2940#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {2940#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {2941#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {2941#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {2942#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:21,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {2942#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2943#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:21,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {2943#(<= main_~i~0 6)} assume !(~i~0 < 1023); {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:21,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:21,002 INFO L272 TraceCheckUtils]: 28: Hoare triple {2933#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2933#false} is VALID [2022-04-15 12:16:21,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-15 12:16:21,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-15 12:16:21,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-15 12:16:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:21,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:21,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-15 12:16:21,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-15 12:16:21,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-15 12:16:21,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {2933#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2933#false} is VALID [2022-04-15 12:16:21,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 12:16:21,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2933#false} is VALID [2022-04-15 12:16:21,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {3081#(< main_~i~0 1023)} assume !(~i~0 < 1023); {2933#false} is VALID [2022-04-15 12:16:21,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {3085#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3081#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:21,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {3085#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3085#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:21,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {3092#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3085#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:21,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {3092#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3092#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:21,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {3099#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3092#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:21,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {3099#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3099#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:21,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3106#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3099#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:21,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3106#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:21,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {3113#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3106#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:21,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {3113#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3113#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:21,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {3120#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3113#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:21,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3120#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:21,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3120#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:21,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret5 := main(); {2932#true} is VALID [2022-04-15 12:16:21,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 12:16:21,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 12:16:21,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2932#true} is VALID [2022-04-15 12:16:21,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-15 12:16:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:21,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993689319] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:21,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:21,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 12:16:21,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:21,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797093607] [2022-04-15 12:16:21,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797093607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:21,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:21,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:16:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876812313] [2022-04-15 12:16:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 12:16:21,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:21,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:21,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:16:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:16:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:16:21,370 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:21,789 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-15 12:16:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:16:21,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 12:16:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-15 12:16:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-15 12:16:21,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-15 12:16:21,867 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-15 12:16:21,880 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:16:21,880 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:16:21,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 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-15 12:16:21,881 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:21,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 36 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:16:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-04-15 12:16:21,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:21,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 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-15 12:16:21,941 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 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-15 12:16:21,942 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 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-15 12:16:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:21,944 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-15 12:16:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-15 12:16:21,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:21,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:21,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 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 57 states. [2022-04-15 12:16:21,945 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 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 57 states. [2022-04-15 12:16:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:21,953 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-15 12:16:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-15 12:16:21,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:21,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:21,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:21,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 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-15 12:16:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-15 12:16:21,958 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2022-04-15 12:16:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:21,958 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-15 12:16:21,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-15 12:16:22,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 12:16:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:16:22,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:22,004 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:22,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:22,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:16:22,224 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash 842696861, now seen corresponding path program 15 times [2022-04-15 12:16:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:22,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198918458] [2022-04-15 12:16:22,237 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:22,237 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 842696861, now seen corresponding path program 16 times [2022-04-15 12:16:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:22,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266697825] [2022-04-15 12:16:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {3497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3484#true} is VALID [2022-04-15 12:16:22,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 12:16:22,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 12:16:22,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {3484#true} call ULTIMATE.init(); {3497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:22,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {3497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3484#true} is VALID [2022-04-15 12:16:22,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 12:16:22,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 12:16:22,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {3484#true} call #t~ret5 := main(); {3484#true} is VALID [2022-04-15 12:16:22,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {3484#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3489#(= main_~i~0 0)} is VALID [2022-04-15 12:16:22,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {3489#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3489#(= main_~i~0 0)} is VALID [2022-04-15 12:16:22,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {3489#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {3490#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {3490#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {3491#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {3492#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3492#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {3494#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {3495#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {3495#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3496#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:22,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= main_~i~0 7)} assume !(~i~0 < 1023); {3485#false} is VALID [2022-04-15 12:16:22,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#false} assume !(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L272 TraceCheckUtils]: 30: Hoare triple {3485#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} ~cond := #in~cond; {3485#false} is VALID [2022-04-15 12:16:22,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} assume 0 == ~cond; {3485#false} is VALID [2022-04-15 12:16:22,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-04-15 12:16:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266697825] [2022-04-15 12:16:22,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266697825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484338218] [2022-04-15 12:16:22,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:22,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:22,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:22,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:16:22,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:22,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:22,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:16:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:22,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {3484#true} call ULTIMATE.init(); {3484#true} is VALID [2022-04-15 12:16:22,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3484#true} is VALID [2022-04-15 12:16:22,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 12:16:22,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 12:16:22,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {3484#true} call #t~ret5 := main(); {3484#true} is VALID [2022-04-15 12:16:22,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {3484#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3516#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:22,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {3516#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3516#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:22,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {3516#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {3490#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {3490#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {3491#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {3492#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {3492#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {3494#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {3495#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {3495#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3496#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:22,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= main_~i~0 7)} assume !(~i~0 < 1023); {3485#false} is VALID [2022-04-15 12:16:22,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {3485#false} is VALID [2022-04-15 12:16:22,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:22,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:22,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 12:16:22,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:22,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#false} assume !(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L272 TraceCheckUtils]: 30: Hoare triple {3485#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} ~cond := #in~cond; {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} assume 0 == ~cond; {3485#false} is VALID [2022-04-15 12:16:22,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-04-15 12:16:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:22,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:23,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-04-15 12:16:23,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} assume 0 == ~cond; {3485#false} is VALID [2022-04-15 12:16:23,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} ~cond := #in~cond; {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L272 TraceCheckUtils]: 30: Hoare triple {3485#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#false} assume !(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 12:16:23,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 12:16:23,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 12:16:23,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {3485#false} is VALID [2022-04-15 12:16:23,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {3640#(< main_~i~0 1023)} assume !(~i~0 < 1023); {3485#false} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {3644#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3640#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:23,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {3644#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3644#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {3651#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3644#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {3651#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3651#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:23,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {3658#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3651#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {3658#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3658#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:23,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {3665#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3658#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:23,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {3665#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3665#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:23,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {3672#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3665#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:23,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {3672#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3672#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:23,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {3679#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3672#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:23,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {3679#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3679#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:23,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {3686#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3679#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:23,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {3686#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3686#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:23,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {3484#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3686#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:23,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {3484#true} call #t~ret5 := main(); {3484#true} is VALID [2022-04-15 12:16:23,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 12:16:23,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 12:16:23,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3484#true} is VALID [2022-04-15 12:16:23,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {3484#true} call ULTIMATE.init(); {3484#true} is VALID [2022-04-15 12:16:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:23,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484338218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:23,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:23,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 12:16:23,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:23,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198918458] [2022-04-15 12:16:23,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198918458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:23,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:23,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:16:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399131068] [2022-04-15 12:16:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:23,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:16:23,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:23,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:16:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:16:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:16:23,201 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,754 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-04-15 12:16:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:16:23,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:16:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-04-15 12:16:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-04-15 12:16:23,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2022-04-15 12:16:23,840 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-15 12:16:23,842 INFO L225 Difference]: With dead ends: 77 [2022-04-15 12:16:23,842 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:16:23,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:16:23,843 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:23,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 36 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:16:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2022-04-15 12:16:23,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:23,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,940 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,940 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,942 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-15 12:16:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-15 12:16:23,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:23,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:23,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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 63 states. [2022-04-15 12:16:23,952 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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 63 states. [2022-04-15 12:16:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,954 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-15 12:16:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-15 12:16:23,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:23,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:23,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:23,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 12:16:23,955 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2022-04-15 12:16:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:23,955 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 12:16:23,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 12:16:24,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 12:16:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:16:24,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:24,024 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:24,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:24,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:24,225 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash 615486527, now seen corresponding path program 17 times [2022-04-15 12:16:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049878284] [2022-04-15 12:16:24,231 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:24,232 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash 615486527, now seen corresponding path program 18 times [2022-04-15 12:16:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:24,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278144087] [2022-04-15 12:16:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4080#true} is VALID [2022-04-15 12:16:24,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 12:16:24,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 12:16:24,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:24,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4080#true} is VALID [2022-04-15 12:16:24,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 12:16:24,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 12:16:24,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret5 := main(); {4080#true} is VALID [2022-04-15 12:16:24,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4085#(= main_~i~0 0)} is VALID [2022-04-15 12:16:24,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {4085#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4085#(= main_~i~0 0)} is VALID [2022-04-15 12:16:24,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {4085#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {4086#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {4086#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {4087#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4088#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:24,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4088#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:24,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {4088#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4089#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:24,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {4089#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4089#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:24,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {4089#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4090#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:24,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {4090#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4090#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:24,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {4090#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4091#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:24,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {4091#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4091#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:24,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {4091#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4092#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:24,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {4092#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4092#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:24,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {4092#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4093#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {4093#(<= main_~i~0 8)} assume !(~i~0 < 1023); {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {4081#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {4081#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {4081#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {4081#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {4081#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {4081#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4081#false} is VALID [2022-04-15 12:16:24,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {4081#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4081#false} is VALID [2022-04-15 12:16:24,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {4081#false} assume !(0 != #t~mem4);havoc #t~mem4; {4081#false} is VALID [2022-04-15 12:16:24,440 INFO L272 TraceCheckUtils]: 32: Hoare triple {4081#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4081#false} is VALID [2022-04-15 12:16:24,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-15 12:16:24,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 12:16:24,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 12:16:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278144087] [2022-04-15 12:16:24,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278144087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16826640] [2022-04-15 12:16:24,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:24,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:24,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:24,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:16:24,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:24,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:24,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:24,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-15 12:16:24,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4080#true} is VALID [2022-04-15 12:16:24,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret5 := main(); {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {4080#true} assume !(~i~0 < 1023); {4080#true} is VALID [2022-04-15 12:16:24,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {4080#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4167#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:24,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {4167#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4167#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:24,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {4167#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {4167#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:24,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {4167#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {4086#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4086#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {4086#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:24,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {4086#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {4087#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4087#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {4087#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:24,743 INFO L272 TraceCheckUtils]: 32: Hoare triple {4087#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:24,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:24,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {4199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 12:16:24,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 12:16:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 12:16:24,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:24,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 12:16:24,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {4199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 12:16:24,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:24,984 INFO L272 TraceCheckUtils]: 32: Hoare triple {4215#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:24,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {4215#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {4215#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:24,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {4215#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4215#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:24,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {4225#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4215#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:24,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {4225#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {4225#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:24,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {4225#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4225#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:24,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {4235#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4225#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:24,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {4235#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {4235#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:24,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {4235#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4235#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:24,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {4080#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4235#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:24,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {4080#true} assume !(~i~0 < 1023); {4080#true} is VALID [2022-04-15 12:16:24,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret5 := main(); {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4080#true} is VALID [2022-04-15 12:16:24,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-15 12:16:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 12:16:24,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16826640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:24,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:24,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-04-15 12:16:24,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:24,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049878284] [2022-04-15 12:16:24,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049878284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:24,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:24,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:16:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912298177] [2022-04-15 12:16:24,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:16:24,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:24,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,016 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-15 12:16:25,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:16:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:16:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:16:25,018 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:25,667 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-15 12:16:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:16:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:16:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-04-15 12:16:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-04-15 12:16:25,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 87 transitions. [2022-04-15 12:16:25,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:25,781 INFO L225 Difference]: With dead ends: 83 [2022-04-15 12:16:25,781 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:16:25,782 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:16:25,782 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:25,783 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:16:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-04-15 12:16:25,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:25,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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-15 12:16:25,839 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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-15 12:16:25,840 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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-15 12:16:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:25,841 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-15 12:16:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-04-15 12:16:25,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:25,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:25,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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 69 states. [2022-04-15 12:16:25,842 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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 69 states. [2022-04-15 12:16:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:25,843 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-15 12:16:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-04-15 12:16:25,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:25,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:25,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:25,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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-15 12:16:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-15 12:16:25,845 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2022-04-15 12:16:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:25,845 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-15 12:16:25,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-15 12:16:25,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 12:16:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:16:25,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:25,898 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:25,931 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-15 12:16:26,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 12:16:26,113 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:26,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1309687649, now seen corresponding path program 19 times [2022-04-15 12:16:26,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:26,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1194602142] [2022-04-15 12:16:26,120 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:26,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1309687649, now seen corresponding path program 20 times [2022-04-15 12:16:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449652526] [2022-04-15 12:16:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:26,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {4731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4716#true} is VALID [2022-04-15 12:16:26,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 12:16:26,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 12:16:26,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {4716#true} call ULTIMATE.init(); {4731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:26,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {4731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4716#true} is VALID [2022-04-15 12:16:26,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 12:16:26,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 12:16:26,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {4716#true} call #t~ret5 := main(); {4716#true} is VALID [2022-04-15 12:16:26,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {4716#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4721#(= main_~i~0 0)} is VALID [2022-04-15 12:16:26,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {4721#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4721#(= main_~i~0 0)} is VALID [2022-04-15 12:16:26,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {4721#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:26,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {4722#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:26,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {4722#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:26,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {4723#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:26,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {4723#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:26,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:26,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:26,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {4725#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:26,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {4725#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:26,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {4726#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:26,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {4726#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:26,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {4727#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:26,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {4727#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:26,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {4728#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:26,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {4728#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:26,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {4729#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:26,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {4729#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4730#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:26,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {4730#(<= main_~i~0 9)} assume !(~i~0 < 1023); {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {4717#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:26,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {4717#false} assume !(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:26,333 INFO L272 TraceCheckUtils]: 34: Hoare triple {4717#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4717#false} is VALID [2022-04-15 12:16:26,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#false} ~cond := #in~cond; {4717#false} is VALID [2022-04-15 12:16:26,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {4717#false} assume 0 == ~cond; {4717#false} is VALID [2022-04-15 12:16:26,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {4717#false} assume !false; {4717#false} is VALID [2022-04-15 12:16:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:26,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449652526] [2022-04-15 12:16:26,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449652526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:26,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94013583] [2022-04-15 12:16:26,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:26,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:26,335 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:26,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:16:26,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:26,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:26,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:16:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:26,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:26,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {4716#true} call ULTIMATE.init(); {4716#true} is VALID [2022-04-15 12:16:26,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {4716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4716#true} is VALID [2022-04-15 12:16:26,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 12:16:26,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 12:16:26,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {4716#true} call #t~ret5 := main(); {4716#true} is VALID [2022-04-15 12:16:26,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {4716#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4750#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:26,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {4750#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4750#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:26,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {4750#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:26,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {4722#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:26,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {4722#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:26,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {4723#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:26,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {4723#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:26,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:26,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:26,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {4725#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:26,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {4725#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:26,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {4726#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:26,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {4726#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:26,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {4727#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:26,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {4727#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:26,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {4728#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:26,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {4728#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:26,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {4729#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:26,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {4729#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4730#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:26,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {4730#(<= main_~i~0 9)} assume !(~i~0 < 1023); {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {4717#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:26,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {4717#false} assume !(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:26,644 INFO L272 TraceCheckUtils]: 34: Hoare triple {4717#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4717#false} is VALID [2022-04-15 12:16:26,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#false} ~cond := #in~cond; {4717#false} is VALID [2022-04-15 12:16:26,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {4717#false} assume 0 == ~cond; {4717#false} is VALID [2022-04-15 12:16:26,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {4717#false} assume !false; {4717#false} is VALID [2022-04-15 12:16:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:26,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:27,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {4717#false} assume !false; {4717#false} is VALID [2022-04-15 12:16:27,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {4717#false} assume 0 == ~cond; {4717#false} is VALID [2022-04-15 12:16:27,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#false} ~cond := #in~cond; {4717#false} is VALID [2022-04-15 12:16:27,150 INFO L272 TraceCheckUtils]: 34: Hoare triple {4717#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4717#false} is VALID [2022-04-15 12:16:27,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {4717#false} assume !(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 12:16:27,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {4717#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4717#false} is VALID [2022-04-15 12:16:27,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#(< main_~i~0 1023)} assume !(~i~0 < 1023); {4717#false} is VALID [2022-04-15 12:16:27,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {4890#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4886#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:27,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {4890#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4890#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:27,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {4897#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4890#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:27,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {4897#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4897#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:27,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {4904#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4897#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:27,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {4904#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4904#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:27,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {4911#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4904#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:27,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4911#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:27,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {4918#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4911#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:27,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {4918#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4918#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:27,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {4925#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4918#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:27,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {4925#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4925#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:27,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {4932#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4925#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:27,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {4932#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4932#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:27,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {4939#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4932#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:27,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {4939#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4939#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:27,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {4946#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4939#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:27,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {4946#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4946#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:27,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {4716#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4946#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:27,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {4716#true} call #t~ret5 := main(); {4716#true} is VALID [2022-04-15 12:16:27,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 12:16:27,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 12:16:27,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {4716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4716#true} is VALID [2022-04-15 12:16:27,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {4716#true} call ULTIMATE.init(); {4716#true} is VALID [2022-04-15 12:16:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:27,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94013583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:27,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:27,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 12:16:27,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:27,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1194602142] [2022-04-15 12:16:27,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1194602142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:27,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:27,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:16:27,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102960726] [2022-04-15 12:16:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:16:27,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:27,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:27,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:16:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:16:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:16:27,207 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,844 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-04-15 12:16:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:16:27,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:16:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-04-15 12:16:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-04-15 12:16:27,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 94 transitions. [2022-04-15 12:16:27,931 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-15 12:16:27,933 INFO L225 Difference]: With dead ends: 89 [2022-04-15 12:16:27,933 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:16:27,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:16:27,934 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:27,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 26 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:16:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2022-04-15 12:16:28,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:28,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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-15 12:16:28,004 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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-15 12:16:28,004 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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-15 12:16:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:28,006 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 12:16:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 12:16:28,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:28,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:28,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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 75 states. [2022-04-15 12:16:28,006 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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 75 states. [2022-04-15 12:16:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:28,008 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 12:16:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 12:16:28,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:28,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:28,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:28,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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-15 12:16:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-15 12:16:28,009 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2022-04-15 12:16:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:28,010 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-15 12:16:28,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:28,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-15 12:16:28,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:16:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:16:28,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:28,065 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:28,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:28,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:16:28,281 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1577932285, now seen corresponding path program 21 times [2022-04-15 12:16:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005345061] [2022-04-15 12:16:28,287 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:28,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1577932285, now seen corresponding path program 22 times [2022-04-15 12:16:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:28,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914874057] [2022-04-15 12:16:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {5416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5400#true} is VALID [2022-04-15 12:16:28,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 12:16:28,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 12:16:28,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {5400#true} call ULTIMATE.init(); {5416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:28,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {5416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5400#true} is VALID [2022-04-15 12:16:28,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 12:16:28,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 12:16:28,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {5400#true} call #t~ret5 := main(); {5400#true} is VALID [2022-04-15 12:16:28,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {5400#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5405#(= main_~i~0 0)} is VALID [2022-04-15 12:16:28,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {5405#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5405#(= main_~i~0 0)} is VALID [2022-04-15 12:16:28,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {5405#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {5407#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {5408#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {5408#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {5409#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {5409#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {5410#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {5411#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 12:16:28,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {5411#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {5412#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {5412#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {5413#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {5413#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {5414#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {5414#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5415#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {5415#(<= main_~i~0 10)} assume !(~i~0 < 1023); {5401#false} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {5401#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {5401#false} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 12:16:28,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:28,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:28,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {5401#false} assume !(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:28,546 INFO L272 TraceCheckUtils]: 36: Hoare triple {5401#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {5401#false} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {5401#false} ~cond := #in~cond; {5401#false} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {5401#false} assume 0 == ~cond; {5401#false} is VALID [2022-04-15 12:16:28,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {5401#false} assume !false; {5401#false} is VALID [2022-04-15 12:16:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:28,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914874057] [2022-04-15 12:16:28,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914874057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:28,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787379447] [2022-04-15 12:16:28,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:28,549 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:28,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:16:28,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:28,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:28,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:16:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:28,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {5400#true} call ULTIMATE.init(); {5400#true} is VALID [2022-04-15 12:16:28,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {5400#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5400#true} is VALID [2022-04-15 12:16:28,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 12:16:28,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 12:16:28,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {5400#true} call #t~ret5 := main(); {5400#true} is VALID [2022-04-15 12:16:28,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {5400#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5435#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:28,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {5435#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5435#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:28,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {5435#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {5407#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {5408#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {5408#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {5409#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {5409#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {5410#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {5411#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 12:16:28,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {5411#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {5412#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {5412#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {5413#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {5413#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {5414#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {5414#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5415#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {5415#(<= main_~i~0 10)} assume !(~i~0 < 1023); {5401#false} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {5401#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {5401#false} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:28,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {5401#false} assume !(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L272 TraceCheckUtils]: 36: Hoare triple {5401#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {5401#false} ~cond := #in~cond; {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {5401#false} assume 0 == ~cond; {5401#false} is VALID [2022-04-15 12:16:28,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {5401#false} assume !false; {5401#false} is VALID [2022-04-15 12:16:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:28,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:29,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {5401#false} assume !false; {5401#false} is VALID [2022-04-15 12:16:29,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {5401#false} assume 0 == ~cond; {5401#false} is VALID [2022-04-15 12:16:29,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {5401#false} ~cond := #in~cond; {5401#false} is VALID [2022-04-15 12:16:29,338 INFO L272 TraceCheckUtils]: 36: Hoare triple {5401#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {5401#false} is VALID [2022-04-15 12:16:29,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {5401#false} assume !(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 12:16:29,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {5401#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {5401#false} is VALID [2022-04-15 12:16:29,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {5577#(< main_~i~0 1023)} assume !(~i~0 < 1023); {5401#false} is VALID [2022-04-15 12:16:29,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {5581#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5577#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:29,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {5581#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5581#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:29,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {5588#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5581#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:29,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {5588#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5588#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:29,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {5595#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5588#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:29,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {5595#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5595#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:29,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {5602#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5595#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:29,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {5602#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5602#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:29,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {5609#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5602#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:29,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {5609#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5609#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:29,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {5616#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5609#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:29,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {5616#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5616#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:29,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {5623#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5616#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:29,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {5623#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5623#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:29,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {5630#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5623#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:29,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {5630#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5630#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:29,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5630#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:29,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {5637#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5637#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:29,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {5644#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5637#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:29,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {5644#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5644#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:29,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {5400#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5644#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:29,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {5400#true} call #t~ret5 := main(); {5400#true} is VALID [2022-04-15 12:16:29,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 12:16:29,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 12:16:29,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {5400#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5400#true} is VALID [2022-04-15 12:16:29,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {5400#true} call ULTIMATE.init(); {5400#true} is VALID [2022-04-15 12:16:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:29,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787379447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:29,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:29,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 12:16:29,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:29,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005345061] [2022-04-15 12:16:29,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005345061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:29,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:29,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:16:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603663773] [2022-04-15 12:16:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:16:29,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:29,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:29,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:16:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:16:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:16:29,381 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,022 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-04-15 12:16:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:16:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:16:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-15 12:16:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-15 12:16:30,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2022-04-15 12:16:30,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,113 INFO L225 Difference]: With dead ends: 95 [2022-04-15 12:16:30,113 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 12:16:30,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:16:30,114 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:30,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 31 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 12:16:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 43. [2022-04-15 12:16:30,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:30,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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-15 12:16:30,186 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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-15 12:16:30,187 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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-15 12:16:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,188 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-04-15 12:16:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-04-15 12:16:30,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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 81 states. [2022-04-15 12:16:30,189 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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 81 states. [2022-04-15 12:16:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,190 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-04-15 12:16:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-04-15 12:16:30,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:30,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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-15 12:16:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-15 12:16:30,192 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2022-04-15 12:16:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:30,192 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-15 12:16:30,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-15 12:16:30,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-15 12:16:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:16:30,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:30,248 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:30,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:30,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:16:30,468 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2031815643, now seen corresponding path program 23 times [2022-04-15 12:16:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:30,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024489005] [2022-04-15 12:16:30,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:30,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2031815643, now seen corresponding path program 24 times [2022-04-15 12:16:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:30,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074745504] [2022-04-15 12:16:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:30,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {6145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6128#true} is VALID [2022-04-15 12:16:30,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 12:16:30,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 12:16:30,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {6128#true} call ULTIMATE.init(); {6145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:30,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {6145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6128#true} is VALID [2022-04-15 12:16:30,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 12:16:30,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 12:16:30,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {6128#true} call #t~ret5 := main(); {6128#true} is VALID [2022-04-15 12:16:30,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {6128#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6133#(= main_~i~0 0)} is VALID [2022-04-15 12:16:30,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {6133#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6133#(= main_~i~0 0)} is VALID [2022-04-15 12:16:30,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {6133#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:30,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {6134#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:30,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {6134#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:30,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {6135#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:30,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {6135#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6136#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:30,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {6136#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6136#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:30,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {6136#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6137#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:30,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {6137#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6137#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:30,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {6137#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6138#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:30,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {6138#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6138#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:30,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {6138#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6139#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:30,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {6139#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6139#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:30,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {6139#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6140#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:30,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {6140#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6140#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:30,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {6140#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6141#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:30,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {6141#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6141#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:30,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {6141#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6142#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:30,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {6142#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6142#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:30,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {6142#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6143#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:30,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {6143#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6143#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:30,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {6143#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6144#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {6144#(<= main_~i~0 11)} assume !(~i~0 < 1023); {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {6129#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {6129#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {6129#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {6129#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {6129#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {6129#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6129#false} is VALID [2022-04-15 12:16:30,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {6129#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {6129#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {6129#false} assume !(0 != #t~mem4);havoc #t~mem4; {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L272 TraceCheckUtils]: 38: Hoare triple {6129#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {6129#false} ~cond := #in~cond; {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {6129#false} assume 0 == ~cond; {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#false} assume !false; {6129#false} is VALID [2022-04-15 12:16:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:30,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074745504] [2022-04-15 12:16:30,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074745504] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:30,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699001542] [2022-04-15 12:16:30,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:30,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:30,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:30,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:16:30,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:30,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:30,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:30,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:31,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {6128#true} call ULTIMATE.init(); {6128#true} is VALID [2022-04-15 12:16:31,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {6128#true} call #t~ret5 := main(); {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {6128#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {6128#true} assume !(~i~0 < 1023); {6128#true} is VALID [2022-04-15 12:16:31,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {6128#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6236#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {6236#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6236#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {6236#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {6236#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {6236#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {6134#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6134#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {6134#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {6134#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {6135#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6135#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {6135#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,033 INFO L272 TraceCheckUtils]: 38: Hoare triple {6135#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:31,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:31,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {6268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6129#false} is VALID [2022-04-15 12:16:31,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#false} assume !false; {6129#false} is VALID [2022-04-15 12:16:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 12:16:31,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:31,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#false} assume !false; {6129#false} is VALID [2022-04-15 12:16:31,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {6268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6129#false} is VALID [2022-04-15 12:16:31,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:31,267 INFO L272 TraceCheckUtils]: 38: Hoare triple {6284#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:31,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {6284#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {6284#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:31,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {6284#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6284#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:31,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {6294#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6284#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:31,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {6294#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {6294#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:31,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {6294#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6294#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:31,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {6304#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6294#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:31,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {6304#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {6304#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:31,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {6304#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6304#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {6128#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6304#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {6128#true} assume !(~i~0 < 1023); {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {6128#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {6128#true} call #t~ret5 := main(); {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 12:16:31,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 12:16:31,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6128#true} is VALID [2022-04-15 12:16:31,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {6128#true} call ULTIMATE.init(); {6128#true} is VALID [2022-04-15 12:16:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 12:16:31,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699001542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:31,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:31,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 21 [2022-04-15 12:16:31,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024489005] [2022-04-15 12:16:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024489005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:31,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:16:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836185576] [2022-04-15 12:16:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:16:31,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:31,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:31,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:16:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:16:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:16:31,311 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:32,139 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-04-15 12:16:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:16:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:16:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-15 12:16:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-15 12:16:32,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2022-04-15 12:16:32,250 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-15 12:16:32,254 INFO L225 Difference]: With dead ends: 101 [2022-04-15 12:16:32,254 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 12:16:32,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=680, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:16:32,259 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:32,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 41 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 12:16:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 45. [2022-04-15 12:16:32,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:32,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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-15 12:16:32,352 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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-15 12:16:32,352 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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-15 12:16:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:32,369 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-04-15 12:16:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-04-15 12:16:32,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:32,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:32,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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 87 states. [2022-04-15 12:16:32,369 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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 87 states. [2022-04-15 12:16:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:32,371 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-04-15 12:16:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-04-15 12:16:32,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:32,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:32,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:32,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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-15 12:16:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-15 12:16:32,372 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2022-04-15 12:16:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:32,372 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-15 12:16:32,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:32,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-15 12:16:32,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 12:16:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:16:32,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:32,433 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:32,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:32,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:16:32,652 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:32,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash -127058489, now seen corresponding path program 25 times [2022-04-15 12:16:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:32,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011262470] [2022-04-15 12:16:32,659 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:32,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash -127058489, now seen corresponding path program 26 times [2022-04-15 12:16:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:32,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638571515] [2022-04-15 12:16:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:32,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {6911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6893#true} is VALID [2022-04-15 12:16:32,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 12:16:32,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 12:16:32,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:32,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6893#true} is VALID [2022-04-15 12:16:32,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 12:16:32,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 12:16:32,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret5 := main(); {6893#true} is VALID [2022-04-15 12:16:32,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {6893#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6898#(= main_~i~0 0)} is VALID [2022-04-15 12:16:32,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {6898#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6898#(= main_~i~0 0)} is VALID [2022-04-15 12:16:32,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {6898#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:32,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {6899#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:32,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {6899#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:32,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {6900#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:32,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {6900#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:32,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {6901#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:32,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:32,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:32,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {6902#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:32,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {6903#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:32,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {6903#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:32,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {6904#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:32,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {6904#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:32,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {6905#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:32,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {6905#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:32,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {6906#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:32,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {6906#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:32,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {6907#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:32,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {6907#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:32,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {6908#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:32,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {6908#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:32,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {6909#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:32,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {6909#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6910#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {6910#(<= main_~i~0 12)} assume !(~i~0 < 1023); {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:32,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 12:16:32,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:32,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#false} assume !(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:32,932 INFO L272 TraceCheckUtils]: 40: Hoare triple {6894#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6894#false} is VALID [2022-04-15 12:16:32,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#false} ~cond := #in~cond; {6894#false} is VALID [2022-04-15 12:16:32,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#false} assume 0 == ~cond; {6894#false} is VALID [2022-04-15 12:16:32,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-04-15 12:16:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638571515] [2022-04-15 12:16:32,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638571515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114127916] [2022-04-15 12:16:32,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:32,935 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:32,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:16:33,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:33,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:33,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:16:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:33,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:33,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6893#true} is VALID [2022-04-15 12:16:33,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6893#true} is VALID [2022-04-15 12:16:33,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 12:16:33,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 12:16:33,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret5 := main(); {6893#true} is VALID [2022-04-15 12:16:33,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {6893#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6930#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:33,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {6930#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6930#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:33,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {6930#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:33,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {6899#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:33,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {6899#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:33,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {6900#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:33,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {6900#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:33,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {6901#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:33,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:33,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:33,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {6902#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:33,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {6903#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:33,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {6903#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:33,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {6904#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:33,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {6904#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:33,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {6905#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:33,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {6905#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:33,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {6906#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:33,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {6906#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:33,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {6907#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:33,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {6907#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:33,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {6908#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:33,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {6908#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:33,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {6909#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:33,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {6909#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6910#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:33,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {6910#(<= main_~i~0 12)} assume !(~i~0 < 1023); {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#false} assume !(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L272 TraceCheckUtils]: 40: Hoare triple {6894#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6894#false} is VALID [2022-04-15 12:16:33,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#false} ~cond := #in~cond; {6894#false} is VALID [2022-04-15 12:16:33,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#false} assume 0 == ~cond; {6894#false} is VALID [2022-04-15 12:16:33,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-04-15 12:16:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:33,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:33,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#false} assume 0 == ~cond; {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#false} ~cond := #in~cond; {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L272 TraceCheckUtils]: 40: Hoare triple {6894#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#false} assume !(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 12:16:33,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:33,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:33,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 12:16:33,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 12:16:33,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 12:16:33,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6894#false} is VALID [2022-04-15 12:16:33,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {7084#(< main_~i~0 1023)} assume !(~i~0 < 1023); {6894#false} is VALID [2022-04-15 12:16:33,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {7088#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:33,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {7088#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7088#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:33,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {7095#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7088#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:33,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {7095#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7095#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:33,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {7102#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7095#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:33,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {7102#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7102#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:33,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {7109#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7102#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:33,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {7109#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7109#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:33,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {7116#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7109#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:33,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {7116#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7116#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:33,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {7123#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7116#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:33,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {7123#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7123#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:33,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {7130#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7123#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:33,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {7130#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7130#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:33,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {7137#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7130#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:33,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {7137#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7137#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:33,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {7144#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7137#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:33,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7144#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:33,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {7151#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7144#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:33,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {7151#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7151#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:33,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {7158#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7151#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:33,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {7158#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7158#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:33,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {7165#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7158#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:33,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {7165#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7165#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:33,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {6893#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7165#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:33,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret5 := main(); {6893#true} is VALID [2022-04-15 12:16:33,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 12:16:33,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 12:16:33,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {6893#true} is VALID [2022-04-15 12:16:33,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6893#true} is VALID [2022-04-15 12:16:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114127916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:33,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:33,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 12:16:33,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:33,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011262470] [2022-04-15 12:16:33,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011262470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:33,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:33,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:16:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105009501] [2022-04-15 12:16:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:33,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:16:33,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:33,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:33,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:16:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:16:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:16:33,860 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:34,745 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-04-15 12:16:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:16:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:16:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2022-04-15 12:16:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2022-04-15 12:16:34,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 115 transitions. [2022-04-15 12:16:34,854 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-15 12:16:34,855 INFO L225 Difference]: With dead ends: 107 [2022-04-15 12:16:34,855 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 12:16:34,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:16:34,857 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 157 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:34,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 31 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 12:16:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2022-04-15 12:16:34,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:34,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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-15 12:16:34,980 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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-15 12:16:34,980 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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-15 12:16:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:34,982 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2022-04-15 12:16:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-04-15 12:16:34,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:34,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:34,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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 93 states. [2022-04-15 12:16:34,983 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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 93 states. [2022-04-15 12:16:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:34,984 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2022-04-15 12:16:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-04-15 12:16:34,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:34,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:34,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:34,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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-15 12:16:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-15 12:16:34,986 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2022-04-15 12:16:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:34,986 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-15 12:16:34,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:34,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-15 12:16:35,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:16:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:16:35,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:35,041 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:35,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:35,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:35,263 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 688498409, now seen corresponding path program 27 times [2022-04-15 12:16:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:35,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955366507] [2022-04-15 12:16:35,278 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:35,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 688498409, now seen corresponding path program 28 times [2022-04-15 12:16:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:35,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358634373] [2022-04-15 12:16:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {7728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7709#true} is VALID [2022-04-15 12:16:35,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 12:16:35,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 12:16:35,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:35,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {7728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7709#true} is VALID [2022-04-15 12:16:35,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 12:16:35,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 12:16:35,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret5 := main(); {7709#true} is VALID [2022-04-15 12:16:35,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7714#(= main_~i~0 0)} is VALID [2022-04-15 12:16:35,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {7714#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7714#(= main_~i~0 0)} is VALID [2022-04-15 12:16:35,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {7714#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:35,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {7715#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:35,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:35,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {7716#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:35,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {7716#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:35,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {7717#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:35,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {7717#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:35,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {7718#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:35,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {7718#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:35,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {7719#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:35,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {7719#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:35,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {7720#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:35,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {7720#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:35,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {7721#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:35,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {7721#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:35,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {7722#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:35,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {7722#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:35,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {7723#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:35,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {7723#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:35,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {7724#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:35,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {7724#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:35,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:35,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {7725#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:35,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {7726#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:35,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {7726#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7727#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {7727#(<= main_~i~0 13)} assume !(~i~0 < 1023); {7710#false} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7710#false} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:35,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {7710#false} assume !(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L272 TraceCheckUtils]: 42: Hoare triple {7710#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {7710#false} ~cond := #in~cond; {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {7710#false} assume 0 == ~cond; {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-15 12:16:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:35,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:35,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358634373] [2022-04-15 12:16:35,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358634373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:35,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930446661] [2022-04-15 12:16:35,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:35,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:35,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:35,537 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:35,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:16:35,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:35,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:35,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:16:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:35,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7709#true} is VALID [2022-04-15 12:16:35,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7709#true} is VALID [2022-04-15 12:16:35,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 12:16:35,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 12:16:35,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret5 := main(); {7709#true} is VALID [2022-04-15 12:16:35,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7747#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:35,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {7747#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7747#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:35,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {7747#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:35,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {7715#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:35,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:35,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {7716#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:35,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {7716#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:35,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {7717#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:35,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {7717#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:35,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {7718#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:35,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {7718#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:35,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {7719#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:35,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {7719#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:35,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {7720#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:35,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {7720#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:35,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {7721#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:35,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {7721#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:35,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {7722#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:35,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {7722#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:35,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {7723#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:35,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {7723#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:35,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {7724#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:35,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {7724#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:35,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:35,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {7725#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:35,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {7726#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:35,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {7726#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7727#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:35,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {7727#(<= main_~i~0 13)} assume !(~i~0 < 1023); {7710#false} is VALID [2022-04-15 12:16:35,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {7710#false} assume !(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:35,968 INFO L272 TraceCheckUtils]: 42: Hoare triple {7710#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7710#false} is VALID [2022-04-15 12:16:35,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {7710#false} ~cond := #in~cond; {7710#false} is VALID [2022-04-15 12:16:35,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {7710#false} assume 0 == ~cond; {7710#false} is VALID [2022-04-15 12:16:35,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-15 12:16:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:35,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:36,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-15 12:16:36,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {7710#false} assume 0 == ~cond; {7710#false} is VALID [2022-04-15 12:16:36,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {7710#false} ~cond := #in~cond; {7710#false} is VALID [2022-04-15 12:16:36,724 INFO L272 TraceCheckUtils]: 42: Hoare triple {7710#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7710#false} is VALID [2022-04-15 12:16:36,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {7710#false} assume !(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:36,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:36,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7710#false} is VALID [2022-04-15 12:16:36,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {7907#(< main_~i~0 1023)} assume !(~i~0 < 1023); {7710#false} is VALID [2022-04-15 12:16:36,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {7911#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7907#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:36,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {7911#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7911#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:36,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {7918#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7911#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:36,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {7918#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7918#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:36,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {7925#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7918#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:36,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {7925#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7925#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:36,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7925#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:36,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {7932#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7932#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:36,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {7939#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7932#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:36,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {7939#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7939#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:36,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {7946#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7939#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:36,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {7946#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7946#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:36,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {7953#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7946#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:36,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {7953#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7953#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:36,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {7960#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7953#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:36,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {7960#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7960#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:36,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {7967#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7960#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:36,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {7967#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7967#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:36,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {7974#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7967#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:36,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {7974#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7974#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:36,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {7981#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7974#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:36,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {7981#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7981#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:36,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {7988#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7981#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:36,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {7988#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7988#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:36,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {7995#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7988#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:36,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {7995#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7995#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:36,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7995#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:36,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret5 := main(); {7709#true} is VALID [2022-04-15 12:16:36,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 12:16:36,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 12:16:36,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7709#true} is VALID [2022-04-15 12:16:36,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7709#true} is VALID [2022-04-15 12:16:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:36,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930446661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:36,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:36,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 12:16:36,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:36,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955366507] [2022-04-15 12:16:36,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955366507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:36,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:36,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:16:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614242795] [2022-04-15 12:16:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:16:36,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:36,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:36,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:36,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:16:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:36,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:16:36,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:16:36,776 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,779 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-15 12:16:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:16:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:16:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 122 transitions. [2022-04-15 12:16:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 122 transitions. [2022-04-15 12:16:37,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 122 transitions. [2022-04-15 12:16:37,909 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-15 12:16:37,923 INFO L225 Difference]: With dead ends: 113 [2022-04-15 12:16:37,924 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 12:16:37,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:16:37,925 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 167 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:37,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 36 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 12:16:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 49. [2022-04-15 12:16:38,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:38,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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-15 12:16:38,043 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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-15 12:16:38,043 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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-15 12:16:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,045 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-04-15 12:16:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-04-15 12:16:38,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:38,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:38,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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 99 states. [2022-04-15 12:16:38,046 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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 99 states. [2022-04-15 12:16:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,047 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-04-15 12:16:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-04-15 12:16:38,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:38,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:38,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:38,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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-15 12:16:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-15 12:16:38,049 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2022-04-15 12:16:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:38,050 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-15 12:16:38,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-15 12:16:38,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:16:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 12:16:38,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:38,112 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:38,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:38,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:16:38,326 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1540337781, now seen corresponding path program 29 times [2022-04-15 12:16:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:38,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60032391] [2022-04-15 12:16:38,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:38,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:38,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1540337781, now seen corresponding path program 30 times [2022-04-15 12:16:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:38,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403873681] [2022-04-15 12:16:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:38,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {8589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {8569#true} is VALID [2022-04-15 12:16:38,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 12:16:38,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 12:16:38,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {8569#true} call ULTIMATE.init(); {8589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:38,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {8589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {8569#true} is VALID [2022-04-15 12:16:38,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 12:16:38,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 12:16:38,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {8569#true} call #t~ret5 := main(); {8569#true} is VALID [2022-04-15 12:16:38,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {8569#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8574#(= main_~i~0 0)} is VALID [2022-04-15 12:16:38,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {8574#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8574#(= main_~i~0 0)} is VALID [2022-04-15 12:16:38,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {8574#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {8575#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {8575#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {8576#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {8576#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8577#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:38,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {8577#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8577#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:38,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {8577#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8578#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:38,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {8578#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8578#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:38,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {8578#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8579#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:38,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {8579#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8579#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:38,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {8579#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8580#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:38,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {8580#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8580#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:38,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {8580#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8581#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:38,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {8581#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8581#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:38,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {8581#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8582#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:38,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {8582#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8582#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:38,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {8582#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8583#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:38,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {8583#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8583#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:38,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {8583#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8584#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:38,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {8584#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8584#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:38,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {8584#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8585#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:38,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {8585#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8585#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:38,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {8585#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8586#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:38,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {8586#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8586#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:38,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {8586#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:38,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {8587#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8587#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:38,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {8587#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8588#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:38,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {8588#(<= main_~i~0 14)} assume !(~i~0 < 1023); {8570#false} is VALID [2022-04-15 12:16:38,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {8570#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {8570#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {8570#false} assume !!(0 != #t~mem4);havoc #t~mem4; {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {8570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {8570#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {8570#false} assume !!(0 != #t~mem4);havoc #t~mem4; {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {8570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {8570#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {8570#false} assume !(0 != #t~mem4);havoc #t~mem4; {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L272 TraceCheckUtils]: 44: Hoare triple {8570#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {8570#false} is VALID [2022-04-15 12:16:38,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {8570#false} ~cond := #in~cond; {8570#false} is VALID [2022-04-15 12:16:38,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {8570#false} assume 0 == ~cond; {8570#false} is VALID [2022-04-15 12:16:38,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {8570#false} assume !false; {8570#false} is VALID [2022-04-15 12:16:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:38,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403873681] [2022-04-15 12:16:38,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403873681] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:38,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831772344] [2022-04-15 12:16:38,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:38,638 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:38,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:16:38,723 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:38,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:38,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:38,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {8569#true} call ULTIMATE.init(); {8569#true} is VALID [2022-04-15 12:16:38,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {8569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {8569#true} is VALID [2022-04-15 12:16:38,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 12:16:38,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {8569#true} call #t~ret5 := main(); {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {8569#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:38,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {8569#true} assume !(~i~0 < 1023); {8569#true} is VALID [2022-04-15 12:16:38,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {8698#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:38,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {8698#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8698#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:38,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {8698#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {8698#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:38,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {8698#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {8575#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8575#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {8575#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {8575#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {8576#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8576#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {8576#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,946 INFO L272 TraceCheckUtils]: 44: Hoare triple {8576#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:38,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:38,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {8730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8570#false} is VALID [2022-04-15 12:16:38,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {8570#false} assume !false; {8570#false} is VALID [2022-04-15 12:16:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 12:16:38,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:39,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {8570#false} assume !false; {8570#false} is VALID [2022-04-15 12:16:39,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {8730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8570#false} is VALID [2022-04-15 12:16:39,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:39,219 INFO L272 TraceCheckUtils]: 44: Hoare triple {8746#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:39,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {8746#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {8746#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:39,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {8746#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8746#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:39,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {8756#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:39,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {8756#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {8756#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:39,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {8756#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8756#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:39,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {8766#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8756#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:39,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {8766#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {8766#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:39,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {8766#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8766#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:39,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {8766#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:39,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {8569#true} assume !(~i~0 < 1023); {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {8569#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8569#true} is VALID [2022-04-15 12:16:39,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {8569#true} call #t~ret5 := main(); {8569#true} is VALID [2022-04-15 12:16:39,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 12:16:39,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 12:16:39,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {8569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {8569#true} is VALID [2022-04-15 12:16:39,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {8569#true} call ULTIMATE.init(); {8569#true} is VALID [2022-04-15 12:16:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 12:16:39,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831772344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:39,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:39,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 24 [2022-04-15 12:16:39,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60032391] [2022-04-15 12:16:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60032391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:39,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:39,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:16:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746241993] [2022-04-15 12:16:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:16:39,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:39,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:16:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:16:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:16:39,271 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:40,550 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-04-15 12:16:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:16:40,551 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:16:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2022-04-15 12:16:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2022-04-15 12:16:40,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2022-04-15 12:16:40,717 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-15 12:16:40,719 INFO L225 Difference]: With dead ends: 119 [2022-04-15 12:16:40,719 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 12:16:40,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=532, Invalid=950, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:16:40,721 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 211 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:40,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 31 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 12:16:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 51. [2022-04-15 12:16:40,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:40,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-15 12:16:40,852 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-15 12:16:40,852 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-15 12:16:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:40,855 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-15 12:16:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-15 12:16:40,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:40,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:40,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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 105 states. [2022-04-15 12:16:40,856 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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 105 states. [2022-04-15 12:16:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:40,864 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-15 12:16:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-15 12:16:40,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:40,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:40,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:40,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-15 12:16:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-15 12:16:40,867 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2022-04-15 12:16:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:40,868 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-15 12:16:40,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-15 12:16:40,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-15 12:16:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:16:40,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:40,932 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:40,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:41,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:16:41,145 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:41,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash -263235667, now seen corresponding path program 31 times [2022-04-15 12:16:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:41,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55939181] [2022-04-15 12:16:41,151 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:41,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash -263235667, now seen corresponding path program 32 times [2022-04-15 12:16:41,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:41,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502900028] [2022-04-15 12:16:41,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:41,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 12:16:41,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 12:16:41,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 12:16:41,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:41,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 12:16:41,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 12:16:41,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 12:16:41,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret5 := main(); {9463#true} is VALID [2022-04-15 12:16:41,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9468#(= main_~i~0 0)} is VALID [2022-04-15 12:16:41,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {9468#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9468#(= main_~i~0 0)} is VALID [2022-04-15 12:16:41,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {9468#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:41,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:41,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:41,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:41,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:41,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:41,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:41,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:41,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:41,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:41,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:41,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:41,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:41,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:41,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:41,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:41,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:41,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:41,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:41,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:41,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:41,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:41,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:41,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:41,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:41,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:41,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:41,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -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#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:41,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:41,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 1023); {9464#false} is VALID [2022-04-15 12:16:41,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} assume !(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L272 TraceCheckUtils]: 46: Hoare triple {9464#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {9464#false} is VALID [2022-04-15 12:16:41,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 12:16:41,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 12:16:41,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 12:16:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:41,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:41,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502900028] [2022-04-15 12:16:41,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502900028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:41,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578720539] [2022-04-15 12:16:41,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:41,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:41,412 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:41,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:16:41,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:41,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:41,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:16:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:41,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:42,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-15 12:16:42,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 12:16:42,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 12:16:42,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 12:16:42,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret5 := main(); {9463#true} is VALID [2022-04-15 12:16:42,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:42,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9503#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:42,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:42,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:42,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:42,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:42,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:42,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:42,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:42,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:42,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:42,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:42,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:42,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:42,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:42,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:42,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:42,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:42,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:42,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:42,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:42,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:42,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:42,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:42,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:42,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:42,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:42,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:42,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:42,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -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#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:42,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:42,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 1023); {9464#false} is VALID [2022-04-15 12:16:42,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} assume !(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:42,144 INFO L272 TraceCheckUtils]: 46: Hoare triple {9464#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {9464#false} is VALID [2022-04-15 12:16:42,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 12:16:42,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 12:16:42,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 12:16:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:42,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:42,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 12:16:42,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 12:16:42,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L272 TraceCheckUtils]: 46: Hoare triple {9464#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} assume !(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 12:16:42,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 12:16:42,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {9464#false} is VALID [2022-04-15 12:16:42,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {9675#(< main_~i~0 1023)} assume !(~i~0 < 1023); {9464#false} is VALID [2022-04-15 12:16:42,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {9679#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9675#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:42,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {9679#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9679#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:42,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {9686#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9679#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:42,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {9686#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9686#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:42,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {9693#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9686#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:42,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {9693#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9693#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:42,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {9700#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9693#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:42,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {9700#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9700#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:42,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {9707#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9700#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:42,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {9707#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9707#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:42,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {9714#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9707#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:42,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {9714#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9714#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:42,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {9721#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9714#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:42,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9721#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:42,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {9728#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9721#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:42,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9728#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:42,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {9735#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9728#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:42,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {9735#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9735#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:42,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {9742#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9735#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:42,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {9742#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9742#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:42,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {9749#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9742#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:42,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {9749#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9749#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:42,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {9756#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9749#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:42,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {9756#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9756#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:42,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {9763#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9756#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:42,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {9763#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9763#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:42,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {9770#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9763#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:42,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {9770#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9770#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:42,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {9777#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9770#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:42,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {9777#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9777#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:42,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9777#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:42,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret5 := main(); {9463#true} is VALID [2022-04-15 12:16:42,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 12:16:42,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 12:16:42,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 12:16:42,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-15 12:16:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:42,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578720539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:42,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:42,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 12:16:42,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:42,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55939181] [2022-04-15 12:16:42,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55939181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:42,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:42,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:16:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092501855] [2022-04-15 12:16:42,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:16:42,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:42,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:42,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:16:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:16:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:16:42,848 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:44,281 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 12:16:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:16:44,282 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:16:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-15 12:16:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-15 12:16:44,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 136 transitions. [2022-04-15 12:16:44,443 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-15 12:16:44,455 INFO L225 Difference]: With dead ends: 125 [2022-04-15 12:16:44,456 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 12:16:44,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:16:44,459 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 213 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:44,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 26 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 12:16:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 53. [2022-04-15 12:16:44,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:44,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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-15 12:16:44,626 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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-15 12:16:44,626 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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-15 12:16:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:44,628 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2022-04-15 12:16:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2022-04-15 12:16:44,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:44,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:44,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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 111 states. [2022-04-15 12:16:44,630 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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 111 states. [2022-04-15 12:16:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:44,635 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2022-04-15 12:16:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2022-04-15 12:16:44,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:44,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:44,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:44,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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-15 12:16:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-15 12:16:44,638 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2022-04-15 12:16:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:44,638 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-15 12:16:44,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-15 12:16:44,736 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-15 12:16:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:16:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 12:16:44,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:44,737 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:44,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:44,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:44,941 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1328750769, now seen corresponding path program 33 times [2022-04-15 12:16:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:44,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054524870] [2022-04-15 12:16:44,997 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:44,997 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1328750769, now seen corresponding path program 34 times [2022-04-15 12:16:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:44,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266248821] [2022-04-15 12:16:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {10433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {10411#true} is VALID [2022-04-15 12:16:45,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 12:16:45,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 12:16:45,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {10411#true} call ULTIMATE.init(); {10433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:45,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {10433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {10411#true} is VALID [2022-04-15 12:16:45,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 12:16:45,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 12:16:45,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {10411#true} call #t~ret5 := main(); {10411#true} is VALID [2022-04-15 12:16:45,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {10411#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10416#(= main_~i~0 0)} is VALID [2022-04-15 12:16:45,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {10416#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10416#(= main_~i~0 0)} is VALID [2022-04-15 12:16:45,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {10416#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {10417#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {10417#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {10418#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {10418#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {10419#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {10419#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {10420#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {10420#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {10421#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {10421#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {10422#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {10422#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {10423#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {10423#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {10424#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {10424#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {10426#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {10426#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {10427#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {10427#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {10428#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {10428#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {10429#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {10429#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {10430#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {10430#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {10431#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {10431#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10432#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:45,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {10432#(<= main_~i~0 16)} assume !(~i~0 < 1023); {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {10412#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:45,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {10412#false} assume !(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:45,382 INFO L272 TraceCheckUtils]: 48: Hoare triple {10412#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {10412#false} is VALID [2022-04-15 12:16:45,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {10412#false} ~cond := #in~cond; {10412#false} is VALID [2022-04-15 12:16:45,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {10412#false} assume 0 == ~cond; {10412#false} is VALID [2022-04-15 12:16:45,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {10412#false} assume !false; {10412#false} is VALID [2022-04-15 12:16:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:45,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266248821] [2022-04-15 12:16:45,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266248821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:45,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747041155] [2022-04-15 12:16:45,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:45,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:45,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:45,400 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:45,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:16:45,592 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:45,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:45,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:16:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:45,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {10411#true} call ULTIMATE.init(); {10411#true} is VALID [2022-04-15 12:16:45,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {10411#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {10411#true} is VALID [2022-04-15 12:16:45,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 12:16:45,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 12:16:45,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {10411#true} call #t~ret5 := main(); {10411#true} is VALID [2022-04-15 12:16:45,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {10411#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10452#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:45,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {10452#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10452#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:45,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {10452#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {10417#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {10417#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {10418#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {10418#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {10419#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {10419#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {10420#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {10420#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {10421#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {10421#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {10422#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {10422#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {10423#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {10423#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {10424#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {10424#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {10426#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {10426#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {10427#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {10427#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {10428#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {10428#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {10429#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {10429#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {10430#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {10430#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {10431#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {10431#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10432#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {10432#(<= main_~i~0 16)} assume !(~i~0 < 1023); {10412#false} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {10412#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {10412#false} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:45,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {10412#false} assume !(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L272 TraceCheckUtils]: 48: Hoare triple {10412#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {10412#false} ~cond := #in~cond; {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {10412#false} assume 0 == ~cond; {10412#false} is VALID [2022-04-15 12:16:45,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {10412#false} assume !false; {10412#false} is VALID [2022-04-15 12:16:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:45,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:46,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {10412#false} assume !false; {10412#false} is VALID [2022-04-15 12:16:46,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {10412#false} assume 0 == ~cond; {10412#false} is VALID [2022-04-15 12:16:46,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {10412#false} ~cond := #in~cond; {10412#false} is VALID [2022-04-15 12:16:46,950 INFO L272 TraceCheckUtils]: 48: Hoare triple {10412#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {10412#false} assume !(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 12:16:46,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {10412#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {10412#false} is VALID [2022-04-15 12:16:46,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {10630#(< main_~i~0 1023)} assume !(~i~0 < 1023); {10412#false} is VALID [2022-04-15 12:16:46,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {10634#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10630#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:46,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {10634#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10634#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:46,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {10641#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10634#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:46,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {10641#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10641#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:46,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {10648#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10641#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:46,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {10648#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10648#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:46,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {10655#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10648#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:46,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {10655#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10655#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:46,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {10662#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10655#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:46,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {10662#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10662#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:46,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {10669#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10662#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:46,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {10669#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10669#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:46,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {10676#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10669#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:46,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {10676#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10676#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:46,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {10683#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10676#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:46,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {10683#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10683#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:46,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {10690#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10683#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:46,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {10690#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10690#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:46,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {10697#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10690#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:46,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {10697#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10697#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:46,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {10704#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10697#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:46,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {10704#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -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 1012)} is VALID [2022-04-15 12:16:46,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {10711#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:46,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {10711#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -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 1011)} is VALID [2022-04-15 12:16:46,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {10718#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:46,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {10718#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -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 1010)} is VALID [2022-04-15 12:16:46,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {10725#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10718#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:46,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {10725#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -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 1009)} is VALID [2022-04-15 12:16:46,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {10732#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10725#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:46,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {10732#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -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 1008)} is VALID [2022-04-15 12:16:46,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {10739#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10732#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:46,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {10739#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -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 1007)} is VALID [2022-04-15 12:16:46,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {10411#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10739#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:46,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {10411#true} call #t~ret5 := main(); {10411#true} is VALID [2022-04-15 12:16:46,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 12:16:46,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 12:16:46,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {10411#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {10411#true} is VALID [2022-04-15 12:16:46,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {10411#true} call ULTIMATE.init(); {10411#true} is VALID [2022-04-15 12:16:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:46,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747041155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:46,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:46,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 12:16:46,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054524870] [2022-04-15 12:16:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054524870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:46,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:46,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:16:46,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879572445] [2022-04-15 12:16:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:46,969 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 12:16:46,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:46,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:47,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:47,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:16:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:16:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:16:47,009 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,587 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2022-04-15 12:16:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:16:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 12:16:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2022-04-15 12:16:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2022-04-15 12:16:48,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 143 transitions. [2022-04-15 12:16:48,723 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-15 12:16:48,727 INFO L225 Difference]: With dead ends: 131 [2022-04-15 12:16:48,727 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 12:16:48,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:16:48,730 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 189 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:48,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 41 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 12:16:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 55. [2022-04-15 12:16:48,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:48,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 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-15 12:16:48,886 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 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-15 12:16:48,886 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 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-15 12:16:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,888 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2022-04-15 12:16:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-04-15 12:16:48,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:48,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:48,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 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 117 states. [2022-04-15 12:16:48,893 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 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 117 states. [2022-04-15 12:16:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,908 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2022-04-15 12:16:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-04-15 12:16:48,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:48,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:48,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:48,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 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-15 12:16:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 12:16:48,910 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2022-04-15 12:16:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:48,910 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 12:16:48,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 12:16:49,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 12:16:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:16:49,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:49,015 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:49,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:49,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:49,234 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1208419953, now seen corresponding path program 35 times [2022-04-15 12:16:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:49,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486848999] [2022-04-15 12:16:49,240 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:49,240 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1208419953, now seen corresponding path program 36 times [2022-04-15 12:16:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833824496] [2022-04-15 12:16:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:49,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {11426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11403#true} is VALID [2022-04-15 12:16:49,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:16:49,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 12:16:49,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:49,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {11426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11403#true} is VALID [2022-04-15 12:16:49,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:16:49,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 12:16:49,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret5 := main(); {11403#true} is VALID [2022-04-15 12:16:49,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11408#(= main_~i~0 0)} is VALID [2022-04-15 12:16:49,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {11408#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11408#(= main_~i~0 0)} is VALID [2022-04-15 12:16:49,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {11408#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {11409#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {11409#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {11410#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {11410#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11411#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:49,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {11411#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11411#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:49,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {11411#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11412#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:49,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {11412#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11412#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:49,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {11412#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11413#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:49,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {11413#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11413#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:49,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {11413#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11414#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:49,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {11414#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11414#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:49,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {11414#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11415#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:49,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {11415#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11415#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:49,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {11415#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11416#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:49,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {11416#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11416#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:49,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {11416#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11417#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:49,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {11417#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11417#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:49,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {11417#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11418#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:49,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {11418#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11418#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:49,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {11418#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11419#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:49,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {11419#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11419#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:49,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {11419#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11420#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:49,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {11420#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11420#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:49,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {11420#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11421#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:49,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {11421#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11421#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:49,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {11421#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11422#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:49,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {11422#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11422#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:49,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {11422#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11423#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:49,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {11423#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11423#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:49,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {11423#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11424#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:49,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {11424#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11424#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:49,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {11424#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11425#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:49,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {11425#(<= main_~i~0 17)} assume !(~i~0 < 1023); {11404#false} is VALID [2022-04-15 12:16:49,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {11404#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {11404#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {11404#false} assume !!(0 != #t~mem4);havoc #t~mem4; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {11404#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {11404#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {11404#false} assume !!(0 != #t~mem4);havoc #t~mem4; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {11404#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {11404#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {11404#false} assume !(0 != #t~mem4);havoc #t~mem4; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L272 TraceCheckUtils]: 50: Hoare triple {11404#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {11404#false} ~cond := #in~cond; {11404#false} is VALID [2022-04-15 12:16:49,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {11404#false} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 12:16:49,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 12:16:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833824496] [2022-04-15 12:16:49,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833824496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100839083] [2022-04-15 12:16:49,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:49,557 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:49,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:16:49,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:49,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:49,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:49,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:49,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret5 := main(); {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:49,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {11403#true} assume !(~i~0 < 1023); {11403#true} is VALID [2022-04-15 12:16:49,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {11403#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {11553#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:49,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {11553#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11553#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:49,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {11553#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {11553#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:49,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {11553#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {11409#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {11409#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {11409#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {11410#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {11410#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,932 INFO L272 TraceCheckUtils]: 50: Hoare triple {11410#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:49,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:49,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {11585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 12:16:49,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 12:16:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 12:16:49,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:50,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 12:16:50,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {11585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 12:16:50,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:50,152 INFO L272 TraceCheckUtils]: 50: Hoare triple {11601#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:50,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {11601#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {11601#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:50,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {11601#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11601#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:50,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {11611#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11601#(<= main_~i~0 1024)} is VALID [2022-04-15 12:16:50,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {11611#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {11611#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:50,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {11611#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11611#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:50,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {11621#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11611#(<= main_~i~0 1023)} is VALID [2022-04-15 12:16:50,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {11621#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {11621#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:50,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {11621#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11621#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {11403#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {11621#(<= main_~i~0 1022)} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {11403#true} assume !(~i~0 < 1023); {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11403#true} is VALID [2022-04-15 12:16:50,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret5 := main(); {11403#true} is VALID [2022-04-15 12:16:50,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 12:16:50,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 12:16:50,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11403#true} is VALID [2022-04-15 12:16:50,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11403#true} is VALID [2022-04-15 12:16:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 12:16:50,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100839083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:50,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:50,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2022-04-15 12:16:50,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:50,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486848999] [2022-04-15 12:16:50,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486848999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:50,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:50,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:16:50,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766332148] [2022-04-15 12:16:50,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:50,162 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 12:16:50,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:50,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:50,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:50,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:16:50,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:50,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:16:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:16:50,203 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:52,298 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-15 12:16:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:16:52,298 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 12:16:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2022-04-15 12:16:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2022-04-15 12:16:52,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 150 transitions. [2022-04-15 12:16:52,471 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-15 12:16:52,473 INFO L225 Difference]: With dead ends: 137 [2022-04-15 12:16:52,473 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 12:16:52,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=1265, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:16:52,475 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:52,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 51 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:16:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 12:16:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 57. [2022-04-15 12:16:52,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:52,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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-15 12:16:52,804 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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-15 12:16:52,804 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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-15 12:16:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:52,806 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2022-04-15 12:16:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2022-04-15 12:16:52,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:52,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:52,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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 123 states. [2022-04-15 12:16:52,806 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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 123 states. [2022-04-15 12:16:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:52,808 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2022-04-15 12:16:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2022-04-15 12:16:52,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:52,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:52,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:52,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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-15 12:16:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-15 12:16:52,810 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2022-04-15 12:16:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:52,810 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-15 12:16:52,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-15 12:16:52,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 12:16:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 12:16:52,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:52,892 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:52,923 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-15 12:16:53,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:53,094 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash -111940333, now seen corresponding path program 37 times [2022-04-15 12:16:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:53,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422238046] [2022-04-15 12:16:53,100 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:53,100 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -111940333, now seen corresponding path program 38 times [2022-04-15 12:16:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:53,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625996301] [2022-04-15 12:16:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:53,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {12450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {12426#true} is VALID [2022-04-15 12:16:53,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 12:16:53,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 12:16:53,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:53,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {12450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {12426#true} is VALID [2022-04-15 12:16:53,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 12:16:53,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 12:16:53,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret5 := main(); {12426#true} is VALID [2022-04-15 12:16:53,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {12426#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12431#(= main_~i~0 0)} is VALID [2022-04-15 12:16:53,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {12431#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12431#(= main_~i~0 0)} is VALID [2022-04-15 12:16:53,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {12431#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:53,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {12432#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:53,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {12432#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:53,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {12433#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:53,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:53,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {12434#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:53,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {12434#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:53,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {12435#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:53,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {12435#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:53,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {12436#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:53,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {12436#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:53,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {12437#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:53,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {12437#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:53,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {12438#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:53,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {12438#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:53,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {12439#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:53,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {12439#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:53,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {12440#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:53,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {12440#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:53,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {12441#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:53,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {12441#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:53,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {12442#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:53,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {12442#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:53,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {12443#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:53,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {12443#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:53,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {12444#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:53,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {12444#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:53,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {12445#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:53,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {12445#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:53,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {12446#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:53,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {12446#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:53,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {12447#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:53,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {12447#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:53,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {12448#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:53,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {12448#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12449#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {12449#(<= main_~i~0 18)} assume !(~i~0 < 1023); {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {12427#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:53,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {12427#false} assume !(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:53,404 INFO L272 TraceCheckUtils]: 52: Hoare triple {12427#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12427#false} is VALID [2022-04-15 12:16:53,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {12427#false} ~cond := #in~cond; {12427#false} is VALID [2022-04-15 12:16:53,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {12427#false} assume 0 == ~cond; {12427#false} is VALID [2022-04-15 12:16:53,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2022-04-15 12:16:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625996301] [2022-04-15 12:16:53,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625996301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447555521] [2022-04-15 12:16:53,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:53,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:53,416 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:53,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:16:53,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:53,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:53,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:16:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:53,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:54,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2022-04-15 12:16:54,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {12426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {12426#true} is VALID [2022-04-15 12:16:54,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 12:16:54,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 12:16:54,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret5 := main(); {12426#true} is VALID [2022-04-15 12:16:54,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {12426#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12469#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:54,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {12469#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12469#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:54,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {12469#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:54,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {12432#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:54,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {12432#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:54,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {12433#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:54,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:54,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {12434#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:54,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {12434#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:54,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {12435#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:54,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {12435#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:54,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {12436#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:54,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {12436#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:54,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {12437#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:54,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {12437#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:54,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {12438#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:54,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {12438#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:54,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {12439#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:54,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {12439#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:54,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {12440#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:54,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {12440#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:54,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {12441#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:54,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {12441#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:54,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {12442#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:54,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {12442#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:54,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {12443#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:54,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {12443#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:54,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {12444#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:54,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {12444#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:54,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {12445#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:54,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {12445#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:54,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {12446#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:54,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {12446#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:54,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {12447#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:54,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {12447#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:54,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {12448#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:54,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {12448#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12449#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {12449#(<= main_~i~0 18)} assume !(~i~0 < 1023); {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {12427#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 12:16:54,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:54,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {12427#false} assume !(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:54,223 INFO L272 TraceCheckUtils]: 52: Hoare triple {12427#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12427#false} is VALID [2022-04-15 12:16:54,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {12427#false} ~cond := #in~cond; {12427#false} is VALID [2022-04-15 12:16:54,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {12427#false} assume 0 == ~cond; {12427#false} is VALID [2022-04-15 12:16:54,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2022-04-15 12:16:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:54,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:55,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2022-04-15 12:16:55,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {12427#false} assume 0 == ~cond; {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {12427#false} ~cond := #in~cond; {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L272 TraceCheckUtils]: 52: Hoare triple {12427#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {12427#false} assume !(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 12:16:55,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 12:16:55,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 12:16:55,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {12427#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12427#false} is VALID [2022-04-15 12:16:55,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {12659#(< main_~i~0 1023)} assume !(~i~0 < 1023); {12427#false} is VALID [2022-04-15 12:16:55,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {12663#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12659#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:55,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {12663#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12663#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:55,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {12670#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12663#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:55,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {12670#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12670#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:55,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {12677#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12670#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:55,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {12677#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12677#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:55,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {12684#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12677#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:55,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {12684#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12684#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:55,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {12691#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12684#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:55,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {12691#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12691#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:55,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {12698#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12691#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:55,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {12698#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12698#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:55,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {12705#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12698#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:55,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12705#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:55,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {12712#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12705#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:55,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {12712#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12712#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:55,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {12719#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12712#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:55,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {12719#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12719#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:55,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {12726#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12719#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:55,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {12726#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12726#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:55,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {12733#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12726#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:55,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {12733#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12733#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:55,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {12740#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12733#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:55,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {12740#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12740#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:55,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {12747#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12740#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:55,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {12747#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12747#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:55,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {12754#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12747#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:55,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {12754#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12754#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:55,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {12761#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12754#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:55,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {12761#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12761#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:55,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {12768#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12761#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:55,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {12768#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12768#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:55,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {12775#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12768#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:55,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {12775#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12775#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:55,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {12782#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12775#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:55,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {12782#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12782#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:55,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {12426#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12782#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:55,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret5 := main(); {12426#true} is VALID [2022-04-15 12:16:55,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 12:16:55,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 12:16:55,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {12426#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {12426#true} is VALID [2022-04-15 12:16:55,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2022-04-15 12:16:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:55,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447555521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:55,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:55,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 12:16:55,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:55,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422238046] [2022-04-15 12:16:55,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422238046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:55,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:55,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:16:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42555901] [2022-04-15 12:16:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 12:16:55,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:55,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:55,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:16:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:16:55,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:16:55,279 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:57,079 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-04-15 12:16:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:16:57,079 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 12:16:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-04-15 12:16:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-04-15 12:16:57,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 157 transitions. [2022-04-15 12:16:57,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:57,266 INFO L225 Difference]: With dead ends: 143 [2022-04-15 12:16:57,266 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 12:16:57,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:16:57,268 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:57,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 26 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 12:16:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 59. [2022-04-15 12:16:57,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:57,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,648 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,648 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:57,650 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2022-04-15 12:16:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-04-15 12:16:57,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:57,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:57,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 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 129 states. [2022-04-15 12:16:57,651 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 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 129 states. [2022-04-15 12:16:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:57,653 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2022-04-15 12:16:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-04-15 12:16:57,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:57,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:57,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:57,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-15 12:16:57,654 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2022-04-15 12:16:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:57,655 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-15 12:16:57,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-15 12:16:57,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:16:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 12:16:57,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:57,745 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:57,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:57,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 12:16:57,950 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1962822859, now seen corresponding path program 39 times [2022-04-15 12:16:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:57,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [303205595] [2022-04-15 12:16:57,965 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:57,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1962822859, now seen corresponding path program 40 times [2022-04-15 12:16:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:57,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972395062] [2022-04-15 12:16:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:58,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {13531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {13506#true} is VALID [2022-04-15 12:16:58,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 12:16:58,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 12:16:58,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:58,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {13531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {13506#true} is VALID [2022-04-15 12:16:58,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 12:16:58,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 12:16:58,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret5 := main(); {13506#true} is VALID [2022-04-15 12:16:58,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13511#(= main_~i~0 0)} is VALID [2022-04-15 12:16:58,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {13511#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13511#(= main_~i~0 0)} is VALID [2022-04-15 12:16:58,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {13511#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:58,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:58,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:58,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {13513#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:58,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {13513#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:58,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {13514#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:58,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {13514#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:58,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {13515#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:58,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {13515#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:58,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {13516#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:58,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {13516#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:58,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {13517#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:58,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {13517#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:58,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {13518#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:58,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {13518#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:58,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {13519#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:58,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:58,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {13520#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:58,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:58,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {13521#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:58,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {13521#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:58,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {13522#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:58,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {13522#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:58,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {13523#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:58,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {13523#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:58,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {13524#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:58,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {13524#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:58,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {13525#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:58,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {13525#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:58,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {13526#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:58,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {13526#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:58,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {13527#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:58,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {13527#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:58,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {13528#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:58,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {13528#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:58,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {13529#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:58,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {13529#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13530#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:58,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {13530#(<= main_~i~0 19)} assume !(~i~0 < 1023); {13507#false} is VALID [2022-04-15 12:16:58,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {13507#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {13507#false} is VALID [2022-04-15 12:16:58,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:16:58,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {13507#false} assume !(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L272 TraceCheckUtils]: 54: Hoare triple {13507#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2022-04-15 12:16:58,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2022-04-15 12:16:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:58,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972395062] [2022-04-15 12:16:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972395062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162336230] [2022-04-15 12:16:58,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:58,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:58,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:58,570 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:16:58,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:16:58,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:58,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:58,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:16:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:58,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:59,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2022-04-15 12:16:59,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {13506#true} is VALID [2022-04-15 12:16:59,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 12:16:59,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 12:16:59,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret5 := main(); {13506#true} is VALID [2022-04-15 12:16:59,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13550#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:59,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {13550#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13550#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:59,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {13550#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:59,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:59,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:59,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {13513#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:59,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {13513#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:59,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {13514#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:59,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {13514#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:59,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {13515#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:59,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {13515#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:59,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {13516#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:59,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {13516#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:59,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {13517#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:59,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {13517#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:59,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {13518#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:59,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {13518#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:59,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {13519#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:59,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:59,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {13520#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:59,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:59,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {13521#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:59,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {13521#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:59,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {13522#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:59,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {13522#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:59,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {13523#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:59,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {13523#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:59,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {13524#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:59,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {13524#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:59,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {13525#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:59,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {13525#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:59,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {13526#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:59,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {13526#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:59,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {13527#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:59,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {13527#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:59,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {13528#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:59,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {13528#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:59,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {13529#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:59,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {13529#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13530#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:59,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {13530#(<= main_~i~0 19)} assume !(~i~0 < 1023); {13507#false} is VALID [2022-04-15 12:16:59,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {13507#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {13507#false} is VALID [2022-04-15 12:16:59,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {13507#false} assume !(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L272 TraceCheckUtils]: 54: Hoare triple {13507#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2022-04-15 12:16:59,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2022-04-15 12:16:59,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2022-04-15 12:16:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:16:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:00,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L272 TraceCheckUtils]: 54: Hoare triple {13507#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {13507#false} assume !(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:17:00,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 12:17:00,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 12:17:00,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 12:17:00,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {13507#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {13507#false} is VALID [2022-04-15 12:17:00,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {13746#(< main_~i~0 1023)} assume !(~i~0 < 1023); {13507#false} is VALID [2022-04-15 12:17:00,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {13750#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:00,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {13750#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -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 1022)} is VALID [2022-04-15 12:17:00,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {13757#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:00,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {13757#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -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 1021)} is VALID [2022-04-15 12:17:00,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {13764#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:00,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {13764#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13764#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:00,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {13771#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13764#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:00,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {13771#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13771#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:00,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {13778#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13771#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:00,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {13778#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13778#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:00,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {13785#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13778#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:00,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {13785#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13785#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:00,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {13792#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13785#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:00,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {13792#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13792#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:00,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {13799#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13792#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:00,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {13799#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13799#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:00,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {13806#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13799#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:00,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {13806#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13806#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:00,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {13813#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13806#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:00,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {13813#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13813#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:00,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {13820#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13813#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:00,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {13820#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13820#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:00,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {13827#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13820#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:00,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {13827#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13827#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:00,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {13834#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13827#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:00,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {13834#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13834#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:00,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {13841#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13834#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:00,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {13841#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13841#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:00,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {13848#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13841#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:00,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {13848#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13848#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:00,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {13855#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13848#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:00,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {13855#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13855#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:00,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {13862#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13855#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:00,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {13862#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13862#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:00,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {13869#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13862#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:00,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {13869#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13869#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:00,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {13876#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13869#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:00,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {13876#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13876#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:00,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13876#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:00,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret5 := main(); {13506#true} is VALID [2022-04-15 12:17:00,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 12:17:00,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 12:17:00,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {13506#true} is VALID [2022-04-15 12:17:00,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2022-04-15 12:17:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162336230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:00,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:00,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 12:17:00,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:00,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [303205595] [2022-04-15 12:17:00,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [303205595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:00,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:00,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:17:00,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683824575] [2022-04-15 12:17:00,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:00,035 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 12:17:00,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:00,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:00,076 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-15 12:17:00,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:17:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:17:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:17:00,077 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:01,883 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2022-04-15 12:17:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:17:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 12:17:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2022-04-15 12:17:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2022-04-15 12:17:01,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 164 transitions. [2022-04-15 12:17:02,033 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-15 12:17:02,035 INFO L225 Difference]: With dead ends: 149 [2022-04-15 12:17:02,035 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 12:17:02,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:17:02,037 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 247 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:02,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 36 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 12:17:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 61. [2022-04-15 12:17:02,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:02,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-15 12:17:02,235 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-15 12:17:02,235 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-15 12:17:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:02,237 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-15 12:17:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-15 12:17:02,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:02,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:02,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-15 12:17:02,237 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-15 12:17:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:02,239 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-15 12:17:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-15 12:17:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:02,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:02,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:02,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-15 12:17:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 12:17:02,241 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2022-04-15 12:17:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:02,241 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 12:17:02,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 12:17:02,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 12:17:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 12:17:02,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:02,330 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:02,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:02,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 12:17:02,552 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:02,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1750497495, now seen corresponding path program 41 times [2022-04-15 12:17:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:02,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960232867] [2022-04-15 12:17:02,557 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:02,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1750497495, now seen corresponding path program 42 times [2022-04-15 12:17:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:02,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646559342] [2022-04-15 12:17:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {14656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {14630#true} is VALID [2022-04-15 12:17:02,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 12:17:02,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 12:17:02,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {14630#true} call ULTIMATE.init(); {14656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:02,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {14656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {14630#true} is VALID [2022-04-15 12:17:02,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 12:17:02,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 12:17:02,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {14630#true} call #t~ret5 := main(); {14630#true} is VALID [2022-04-15 12:17:02,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {14630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14635#(= main_~i~0 0)} is VALID [2022-04-15 12:17:02,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {14635#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14635#(= main_~i~0 0)} is VALID [2022-04-15 12:17:02,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {14635#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:02,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {14636#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:02,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {14636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:02,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {14637#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:02,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {14637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14638#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:02,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14638#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:02,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {14638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14639#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:02,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {14639#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14639#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:02,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {14639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14640#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:02,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {14640#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14640#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:02,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {14640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14641#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:02,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {14641#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14641#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:02,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {14641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14642#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:02,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {14642#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14642#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:02,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {14642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14643#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:02,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {14643#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14643#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:02,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {14643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14644#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:02,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {14644#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14644#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:02,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {14644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14645#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:02,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {14645#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14645#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:02,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14646#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:02,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14646#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:02,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {14646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14647#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:02,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {14647#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14647#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:02,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {14647#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14648#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:02,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {14648#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14648#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:02,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {14648#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14649#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:02,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {14649#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14649#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:02,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {14649#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14650#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:02,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {14650#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14650#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:02,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {14650#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14651#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:02,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {14651#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14651#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:02,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {14651#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14652#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:02,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {14652#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14652#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:02,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {14652#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14653#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:02,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {14653#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14653#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:02,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {14653#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14654#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:02,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {14654#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14654#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:02,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {14654#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14655#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:02,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {14655#(<= main_~i~0 20)} assume !(~i~0 < 1023); {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {14631#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {14631#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {14631#false} assume !!(0 != #t~mem4);havoc #t~mem4; {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {14631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {14631#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {14631#false} assume !!(0 != #t~mem4);havoc #t~mem4; {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {14631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {14631#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {14631#false} assume !(0 != #t~mem4);havoc #t~mem4; {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L272 TraceCheckUtils]: 56: Hoare triple {14631#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {14631#false} is VALID [2022-04-15 12:17:02,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {14631#false} ~cond := #in~cond; {14631#false} is VALID [2022-04-15 12:17:02,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {14631#false} assume 0 == ~cond; {14631#false} is VALID [2022-04-15 12:17:02,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {14631#false} assume !false; {14631#false} is VALID [2022-04-15 12:17:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:02,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646559342] [2022-04-15 12:17:02,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646559342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:02,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350094264] [2022-04-15 12:17:02,957 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:02,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:02,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:02,958 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:17:03,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:03,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:03,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:03,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:03,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {14630#true} call ULTIMATE.init(); {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {14630#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {14630#true} call #t~ret5 := main(); {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {14630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:03,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {14630#true} assume !(~i~0 < 1023); {14630#true} is VALID [2022-04-15 12:17:03,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {14630#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {14801#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:03,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {14801#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14801#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:03,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {14801#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {14801#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:03,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {14801#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:03,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {14636#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:03,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:03,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:03,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:03,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:03,692 INFO L272 TraceCheckUtils]: 56: Hoare triple {14637#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:03,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:03,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {14833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14631#false} is VALID [2022-04-15 12:17:03,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {14631#false} assume !false; {14631#false} is VALID [2022-04-15 12:17:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 12:17:03,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:04,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {14631#false} assume !false; {14631#false} is VALID [2022-04-15 12:17:04,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {14833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14631#false} is VALID [2022-04-15 12:17:04,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:04,129 INFO L272 TraceCheckUtils]: 56: Hoare triple {14849#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:04,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {14849#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {14849#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:04,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {14849#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14849#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:04,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {14859#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14849#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:04,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {14859#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {14859#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:04,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {14859#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14859#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:04,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {14869#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14859#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:04,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {14869#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {14869#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:04,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {14869#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14869#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:04,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {14630#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {14869#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {14630#true} assume !(~i~0 < 1023); {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 12:17:04,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {14630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14630#true} is VALID [2022-04-15 12:17:04,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {14630#true} call #t~ret5 := main(); {14630#true} is VALID [2022-04-15 12:17:04,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 12:17:04,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 12:17:04,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {14630#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {14630#true} is VALID [2022-04-15 12:17:04,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {14630#true} call ULTIMATE.init(); {14630#true} is VALID [2022-04-15 12:17:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 12:17:04,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350094264] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:04,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:04,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 7, 7] total 30 [2022-04-15 12:17:04,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:04,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960232867] [2022-04-15 12:17:04,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960232867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:04,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:04,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:17:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264253931] [2022-04-15 12:17:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:04,140 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 12:17:04,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:04,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:04,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:04,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:17:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:17:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:17:04,197 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,062 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-04-15 12:17:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:17:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 12:17:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2022-04-15 12:17:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2022-04-15 12:17:06,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 171 transitions. [2022-04-15 12:17:06,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:06,356 INFO L225 Difference]: With dead ends: 155 [2022-04-15 12:17:06,357 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 12:17:06,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=925, Invalid=1625, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:17:06,358 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 252 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:06,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 36 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 12:17:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 63. [2022-04-15 12:17:06,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:06,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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-15 12:17:06,543 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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-15 12:17:06,543 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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-15 12:17:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,545 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2022-04-15 12:17:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2022-04-15 12:17:06,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:06,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:06,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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 141 states. [2022-04-15 12:17:06,546 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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 141 states. [2022-04-15 12:17:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,548 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2022-04-15 12:17:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2022-04-15 12:17:06,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:06,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:06,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:06,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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-15 12:17:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-04-15 12:17:06,551 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2022-04-15 12:17:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:06,551 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-04-15 12:17:06,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 64 transitions. [2022-04-15 12:17:06,653 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-15 12:17:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-15 12:17:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:17:06,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:06,654 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:06,691 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-15 12:17:06,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:06,875 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1133534713, now seen corresponding path program 43 times [2022-04-15 12:17:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:06,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580427754] [2022-04-15 12:17:06,881 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:06,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1133534713, now seen corresponding path program 44 times [2022-04-15 12:17:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:06,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616582109] [2022-04-15 12:17:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {15809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {15782#true} is VALID [2022-04-15 12:17:07,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 12:17:07,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 12:17:07,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:07,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {15809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {15782#true} is VALID [2022-04-15 12:17:07,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 12:17:07,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 12:17:07,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret5 := main(); {15782#true} is VALID [2022-04-15 12:17:07,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15787#(= main_~i~0 0)} is VALID [2022-04-15 12:17:07,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {15787#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15787#(= main_~i~0 0)} is VALID [2022-04-15 12:17:07,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {15787#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {15788#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {15788#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {15789#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {15789#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:07,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {15790#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:07,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {15790#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:07,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {15791#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:07,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {15791#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:07,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {15792#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:07,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {15792#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:07,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {15793#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:07,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {15793#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:07,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {15794#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:07,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {15794#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:07,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {15795#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:07,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {15795#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:07,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {15796#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:07,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {15796#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:07,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {15797#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:07,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {15797#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:07,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {15798#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:07,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {15798#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:07,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {15799#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:07,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {15799#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:07,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {15800#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:07,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {15800#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:07,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {15801#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:07,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {15801#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:07,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {15802#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:07,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {15802#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:07,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {15803#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:07,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {15803#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:07,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {15804#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:07,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {15804#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:07,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {15805#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:07,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {15805#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:07,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {15806#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:07,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {15806#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:07,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {15807#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:07,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {15807#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15808#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:07,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {15808#(<= main_~i~0 21)} assume !(~i~0 < 1023); {15783#false} is VALID [2022-04-15 12:17:07,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {15783#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {15783#false} is VALID [2022-04-15 12:17:07,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:07,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:07,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {15783#false} assume !(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L272 TraceCheckUtils]: 58: Hoare triple {15783#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 12:17:07,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 12:17:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616582109] [2022-04-15 12:17:07,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616582109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548736521] [2022-04-15 12:17:07,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:07,259 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:07,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:17:07,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:07,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:07,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:17:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:07,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15782#true} is VALID [2022-04-15 12:17:07,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {15782#true} is VALID [2022-04-15 12:17:07,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 12:17:07,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 12:17:07,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret5 := main(); {15782#true} is VALID [2022-04-15 12:17:07,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15828#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:07,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {15828#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15828#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:07,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {15828#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {15788#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {15788#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {15789#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {15789#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:07,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {15790#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:07,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {15790#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:07,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {15791#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:07,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {15791#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:07,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {15792#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:07,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {15792#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:07,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {15793#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:07,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {15793#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:07,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {15794#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:07,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {15794#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:07,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {15795#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:07,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {15795#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:07,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {15796#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:07,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {15796#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:07,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {15797#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:07,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {15797#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:07,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {15798#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:07,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {15798#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:07,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {15799#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:07,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {15799#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:07,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {15800#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:07,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {15800#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:07,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {15801#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:07,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {15801#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:07,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {15802#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:07,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {15802#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:07,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {15803#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:07,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {15803#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:07,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {15804#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:07,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {15804#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:07,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {15805#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:07,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {15805#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:07,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {15806#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:07,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {15806#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:07,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {15807#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:07,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {15807#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15808#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:07,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {15808#(<= main_~i~0 21)} assume !(~i~0 < 1023); {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {15783#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 12:17:07,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:07,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {15783#false} assume !(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:07,913 INFO L272 TraceCheckUtils]: 58: Hoare triple {15783#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {15783#false} is VALID [2022-04-15 12:17:07,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 12:17:07,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 12:17:07,913 INFO L290 TraceCheckUtils]: 61: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 12:17:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:07,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:08,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 12:17:08,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 12:17:08,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 12:17:08,907 INFO L272 TraceCheckUtils]: 58: Hoare triple {15783#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {15783#false} is VALID [2022-04-15 12:17:08,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {15783#false} assume !(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 12:17:08,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {15783#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {15783#false} is VALID [2022-04-15 12:17:08,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {16036#(< main_~i~0 1023)} assume !(~i~0 < 1023); {15783#false} is VALID [2022-04-15 12:17:08,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {16040#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16036#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:08,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {16040#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16040#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:08,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {16047#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16040#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:08,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {16047#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16047#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:08,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {16054#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16047#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:08,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {16054#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16054#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:08,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {16061#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16054#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:08,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {16061#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16061#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:08,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {16068#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16061#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:08,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {16068#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16068#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:08,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {16075#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16068#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:08,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {16075#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16075#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:08,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {16082#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16075#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:08,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {16082#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16082#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:08,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {16089#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16082#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:08,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {16089#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16089#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:08,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {16096#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16089#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:08,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {16096#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16096#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:08,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {16103#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16096#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:08,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {16103#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16103#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:08,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {16110#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16103#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:08,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {16110#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16110#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:08,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {16117#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16110#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:08,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {16117#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16117#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:08,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {16124#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16117#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:08,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {16124#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16124#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:08,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {16131#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16124#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:08,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {16131#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16131#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:08,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {16138#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16131#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:08,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {16138#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16138#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:08,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {16145#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16138#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:08,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {16145#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16145#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:08,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {16152#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16145#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:08,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {16152#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16152#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:08,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {16159#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16152#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:08,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {16159#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16159#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:08,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {16166#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16159#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:08,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {16166#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16166#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:08,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {16173#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16166#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:08,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {16173#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -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 1003)} is VALID [2022-04-15 12:17:08,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {16180#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16173#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:08,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {16180#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -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 1002)} is VALID [2022-04-15 12:17:08,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16180#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:08,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret5 := main(); {15782#true} is VALID [2022-04-15 12:17:08,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 12:17:08,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 12:17:08,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {15782#true} is VALID [2022-04-15 12:17:08,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15782#true} is VALID [2022-04-15 12:17:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548736521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:08,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:08,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 12:17:08,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:08,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580427754] [2022-04-15 12:17:08,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580427754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:08,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:08,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:17:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593179382] [2022-04-15 12:17:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 12:17:08,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:08,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:08,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:08,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:17:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:17:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:17:08,974 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,078 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2022-04-15 12:17:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:17:11,079 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 12:17:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 178 transitions. [2022-04-15 12:17:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 178 transitions. [2022-04-15 12:17:11,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 178 transitions. [2022-04-15 12:17:11,246 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-15 12:17:11,248 INFO L225 Difference]: With dead ends: 161 [2022-04-15 12:17:11,248 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 12:17:11,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:17:11,250 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:11,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 41 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 12:17:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 65. [2022-04-15 12:17:11,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:11,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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-15 12:17:11,478 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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-15 12:17:11,478 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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-15 12:17:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,480 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2022-04-15 12:17:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2022-04-15 12:17:11,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:11,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:11,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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 147 states. [2022-04-15 12:17:11,481 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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 147 states. [2022-04-15 12:17:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,484 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2022-04-15 12:17:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2022-04-15 12:17:11,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:11,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:11,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:11,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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-15 12:17:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2022-04-15 12:17:11,485 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2022-04-15 12:17:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:11,485 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2022-04-15 12:17:11,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 66 transitions. [2022-04-15 12:17:11,603 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-15 12:17:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:17:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 12:17:11,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:11,604 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:11,629 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-15 12:17:11,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:11,818 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash 937788059, now seen corresponding path program 45 times [2022-04-15 12:17:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191211411] [2022-04-15 12:17:11,826 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:11,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 937788059, now seen corresponding path program 46 times [2022-04-15 12:17:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872632541] [2022-04-15 12:17:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:12,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {17022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {16994#true} is VALID [2022-04-15 12:17:12,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 12:17:12,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 12:17:12,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {17022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:12,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {17022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {16994#true} is VALID [2022-04-15 12:17:12,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 12:17:12,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 12:17:12,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret5 := main(); {16994#true} is VALID [2022-04-15 12:17:12,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16999#(= main_~i~0 0)} is VALID [2022-04-15 12:17:12,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {16999#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16999#(= main_~i~0 0)} is VALID [2022-04-15 12:17:12,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {16999#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:12,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {17000#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:12,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {17000#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:12,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {17001#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:12,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {17001#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:12,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {17002#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:12,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {17002#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:12,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {17003#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:12,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {17003#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:12,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {17004#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:12,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {17004#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:12,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {17005#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:12,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {17005#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:12,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {17006#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:12,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {17006#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:12,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {17007#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:12,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {17007#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:12,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {17008#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:12,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {17008#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:12,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {17009#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:12,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {17009#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:12,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {17010#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:12,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {17010#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:12,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {17011#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:12,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {17011#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:12,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {17012#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:12,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {17012#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:12,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {17013#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:12,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {17013#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:12,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {17014#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:12,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {17014#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:12,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {17015#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:12,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {17015#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:12,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {17016#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:12,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {17016#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:12,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {17017#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:12,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {17017#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:12,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {17018#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:12,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {17018#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {17019#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {17019#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {17020#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {17020#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:12,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {17021#(<= main_~i~0 22)} assume !(~i~0 < 1023); {16995#false} is VALID [2022-04-15 12:17:12,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {16995#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {16995#false} is VALID [2022-04-15 12:17:12,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:12,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {16995#false} assume !(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L272 TraceCheckUtils]: 60: Hoare triple {16995#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {16995#false} ~cond := #in~cond; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {16995#false} assume 0 == ~cond; {16995#false} is VALID [2022-04-15 12:17:12,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2022-04-15 12:17:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872632541] [2022-04-15 12:17:12,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872632541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539702339] [2022-04-15 12:17:12,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:12,220 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:12,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:17:12,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:12,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:12,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:17:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:12,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:12,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {16994#true} is VALID [2022-04-15 12:17:12,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {16994#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {16994#true} is VALID [2022-04-15 12:17:12,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 12:17:12,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 12:17:12,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret5 := main(); {16994#true} is VALID [2022-04-15 12:17:12,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17041#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:12,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {17041#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17041#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:12,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {17041#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:12,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {17000#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:12,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {17000#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:12,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {17001#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:12,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {17001#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:12,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {17002#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:12,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {17002#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:12,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {17003#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:12,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {17003#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:12,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {17004#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:12,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {17004#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:12,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {17005#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:12,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {17005#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:12,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {17006#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:12,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {17006#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:12,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {17007#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:12,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {17007#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:12,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {17008#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:12,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {17008#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:12,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {17009#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:12,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {17009#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:12,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {17010#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:12,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {17010#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:12,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {17011#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:12,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {17011#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:12,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {17012#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:12,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {17012#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:12,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {17013#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:12,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {17013#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:12,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {17014#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:12,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {17014#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:12,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {17015#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:12,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {17015#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:12,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {17016#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:12,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {17016#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:12,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {17017#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:12,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {17017#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:12,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {17018#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:12,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {17018#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {17019#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {17019#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {17020#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {17020#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {17021#(<= main_~i~0 22)} assume !(~i~0 < 1023); {16995#false} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {16995#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {16995#false} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:12,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {16995#false} assume !(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L272 TraceCheckUtils]: 60: Hoare triple {16995#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {16995#false} ~cond := #in~cond; {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {16995#false} assume 0 == ~cond; {16995#false} is VALID [2022-04-15 12:17:12,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2022-04-15 12:17:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:12,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:14,005 INFO L290 TraceCheckUtils]: 63: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {16995#false} assume 0 == ~cond; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {16995#false} ~cond := #in~cond; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L272 TraceCheckUtils]: 60: Hoare triple {16995#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {16995#false} assume !(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 12:17:14,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 12:17:14,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 12:17:14,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {16995#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {16995#false} is VALID [2022-04-15 12:17:14,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {17255#(< main_~i~0 1023)} assume !(~i~0 < 1023); {16995#false} is VALID [2022-04-15 12:17:14,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {17259#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17255#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:14,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {17259#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17259#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:14,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {17266#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17259#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:14,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {17266#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17266#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:14,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {17273#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17266#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:14,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {17273#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17273#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:14,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {17280#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17273#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:14,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {17280#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17280#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:14,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {17287#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17280#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:14,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {17287#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17287#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:14,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {17294#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17287#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:14,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {17294#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17294#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:14,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {17301#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17294#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:14,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {17301#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17301#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:14,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {17308#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17301#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:14,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {17308#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17308#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:14,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {17315#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17308#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:14,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {17315#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17315#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:14,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {17322#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17315#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:14,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {17322#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17322#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:14,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {17329#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17322#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:14,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {17329#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17329#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:14,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {17336#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17329#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:14,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {17336#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17336#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:14,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {17343#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17336#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:14,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {17343#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17343#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:14,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {17350#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17343#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:14,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {17350#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17350#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:14,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {17357#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17350#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:14,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {17357#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17357#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:14,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {17364#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17357#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:14,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {17364#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17364#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:14,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {17371#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17364#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:14,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {17371#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17371#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:14,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {17378#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17371#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:14,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {17378#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17378#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:14,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {17385#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17378#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:14,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {17385#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17385#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:14,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {17392#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17385#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:14,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {17392#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17392#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:14,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {17399#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17392#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:14,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {17399#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17399#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:14,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {17406#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17399#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:14,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {17406#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17406#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:14,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17406#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:14,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret5 := main(); {16994#true} is VALID [2022-04-15 12:17:14,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 12:17:14,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 12:17:14,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {16994#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {16994#true} is VALID [2022-04-15 12:17:14,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {16994#true} is VALID [2022-04-15 12:17:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:14,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539702339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:14,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:14,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 12:17:14,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:14,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191211411] [2022-04-15 12:17:14,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191211411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:14,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:14,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:17:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438529547] [2022-04-15 12:17:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 12:17:14,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:14,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:14,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:14,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:17:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:17:14,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:17:14,077 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,352 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2022-04-15 12:17:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:17:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 12:17:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 185 transitions. [2022-04-15 12:17:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 185 transitions. [2022-04-15 12:17:16,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 185 transitions. [2022-04-15 12:17:16,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:16,648 INFO L225 Difference]: With dead ends: 167 [2022-04-15 12:17:16,648 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 12:17:16,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:17:16,650 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 320 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:16,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 31 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 12:17:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 67. [2022-04-15 12:17:16,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:16,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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-15 12:17:16,900 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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-15 12:17:16,900 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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-15 12:17:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,903 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2022-04-15 12:17:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2022-04-15 12:17:16,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:16,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:16,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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 153 states. [2022-04-15 12:17:16,904 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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 153 states. [2022-04-15 12:17:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,908 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2022-04-15 12:17:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2022-04-15 12:17:16,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:16,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:16,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:16,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 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-15 12:17:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 12:17:16,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2022-04-15 12:17:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:16,911 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 12:17:16,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 12:17:17,011 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-15 12:17:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 12:17:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 12:17:17,013 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:17,013 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:17,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:17,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 12:17:17,228 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1803814589, now seen corresponding path program 47 times [2022-04-15 12:17:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501991857] [2022-04-15 12:17:17,234 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:17,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1803814589, now seen corresponding path program 48 times [2022-04-15 12:17:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:17,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127884688] [2022-04-15 12:17:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:17,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {18279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {18250#true} is VALID [2022-04-15 12:17:17,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 12:17:17,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 12:17:17,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:17,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {18279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {18250#true} is VALID [2022-04-15 12:17:17,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 12:17:17,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 12:17:17,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret5 := main(); {18250#true} is VALID [2022-04-15 12:17:17,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18255#(= main_~i~0 0)} is VALID [2022-04-15 12:17:17,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {18255#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18255#(= main_~i~0 0)} is VALID [2022-04-15 12:17:17,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {18255#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:17,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {18256#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:17,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {18256#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:17,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {18257#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:17,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {18257#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18258#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:17,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {18258#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18258#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:17,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {18258#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18259#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:17,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {18259#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18259#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:17,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {18259#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18260#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:17,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {18260#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18260#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:17,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {18260#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18261#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:17,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {18261#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18261#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:17,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {18261#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18262#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:17,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {18262#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18262#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:17,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {18262#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18263#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:17,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {18263#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18263#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:17,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {18263#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18264#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:17,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {18264#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18264#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:17,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {18264#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18265#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:17,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {18265#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18265#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:17,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {18265#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18266#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:17,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {18266#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18266#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:17,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {18266#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18267#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:17,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {18267#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18267#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:17,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {18267#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18268#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:17,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {18268#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18268#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:17,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {18268#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18269#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:17,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {18269#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18269#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:17,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {18269#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18270#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:17,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {18270#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18270#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:17,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {18270#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18271#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:17,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {18271#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18271#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:17,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {18271#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18272#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:17,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {18272#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18272#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:17,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {18272#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18273#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:17,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {18273#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18273#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:17,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {18273#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18274#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:17,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {18274#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18274#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:17,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {18274#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18275#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:17,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {18275#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18275#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:17,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {18275#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18276#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:17,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {18276#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18276#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:17,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {18276#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18277#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:17,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {18277#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18277#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:17,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {18277#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18278#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:17,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {18278#(<= main_~i~0 23)} assume !(~i~0 < 1023); {18251#false} is VALID [2022-04-15 12:17:17,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {18251#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {18251#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {18251#false} assume !!(0 != #t~mem4);havoc #t~mem4; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {18251#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {18251#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {18251#false} assume !!(0 != #t~mem4);havoc #t~mem4; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {18251#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {18251#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {18251#false} assume !(0 != #t~mem4);havoc #t~mem4; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L272 TraceCheckUtils]: 62: Hoare triple {18251#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 63: Hoare triple {18251#false} ~cond := #in~cond; {18251#false} is VALID [2022-04-15 12:17:17,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {18251#false} assume 0 == ~cond; {18251#false} is VALID [2022-04-15 12:17:17,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2022-04-15 12:17:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:17,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127884688] [2022-04-15 12:17:17,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127884688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:17,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720614243] [2022-04-15 12:17:17,649 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:17,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:17,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:17,650 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:17,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:17:17,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:17,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:17,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:17,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:18,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret5 := main(); {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {18250#true} assume !(~i~0 < 1023); {18250#true} is VALID [2022-04-15 12:17:18,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {18250#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {18442#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:18,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {18442#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18442#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:18,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {18442#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {18442#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:18,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {18442#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:18,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {18256#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18256#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:18,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {18256#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:18,075 INFO L290 TraceCheckUtils]: 59: Hoare triple {18256#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:18,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {18257#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18257#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:18,076 INFO L290 TraceCheckUtils]: 61: Hoare triple {18257#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:18,076 INFO L272 TraceCheckUtils]: 62: Hoare triple {18257#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:18,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:18,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {18474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18251#false} is VALID [2022-04-15 12:17:18,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2022-04-15 12:17:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 12:17:18,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:18,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2022-04-15 12:17:18,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {18474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18251#false} is VALID [2022-04-15 12:17:18,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:18,341 INFO L272 TraceCheckUtils]: 62: Hoare triple {18490#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:18,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {18490#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {18490#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:18,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {18490#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18490#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:18,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {18500#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18490#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:18,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {18500#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {18500#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:18,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {18500#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18500#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:18,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {18510#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18500#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:18,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {18510#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {18510#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:18,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {18510#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18510#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {18250#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {18510#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {18250#true} assume !(~i~0 < 1023); {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret5 := main(); {18250#true} is VALID [2022-04-15 12:17:18,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 12:17:18,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 12:17:18,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {18250#true} is VALID [2022-04-15 12:17:18,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18250#true} is VALID [2022-04-15 12:17:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 12:17:18,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720614243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:18,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:18,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 7] total 33 [2022-04-15 12:17:18,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:18,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501991857] [2022-04-15 12:17:18,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501991857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:18,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:18,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:17:18,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626023799] [2022-04-15 12:17:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 12:17:18,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:18,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:18,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:17:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:17:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:17:18,405 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:20,894 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2022-04-15 12:17:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:17:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 12:17:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 192 transitions. [2022-04-15 12:17:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 192 transitions. [2022-04-15 12:17:20,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 192 transitions. [2022-04-15 12:17:21,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,096 INFO L225 Difference]: With dead ends: 173 [2022-04-15 12:17:21,096 INFO L226 Difference]: Without dead ends: 159 [2022-04-15 12:17:21,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1162, Invalid=2030, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:17:21,097 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 318 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:21,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 41 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-15 12:17:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 69. [2022-04-15 12:17:21,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:21,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-15 12:17:21,362 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-15 12:17:21,362 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-15 12:17:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:21,365 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-04-15 12:17:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2022-04-15 12:17:21,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:21,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:21,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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 159 states. [2022-04-15 12:17:21,366 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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 159 states. [2022-04-15 12:17:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:21,368 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-04-15 12:17:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2022-04-15 12:17:21,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:21,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:21,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:21,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-15 12:17:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-15 12:17:21,370 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2022-04-15 12:17:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:21,370 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-15 12:17:21,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-15 12:17:21,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 12:17:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 12:17:21,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:21,478 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:21,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:21,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 12:17:21,691 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:21,692 INFO L85 PathProgramCache]: Analyzing trace with hash 831654495, now seen corresponding path program 49 times [2022-04-15 12:17:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:21,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415943377] [2022-04-15 12:17:21,698 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:21,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash 831654495, now seen corresponding path program 50 times [2022-04-15 12:17:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:21,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025191537] [2022-04-15 12:17:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:22,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {19561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {19531#true} is VALID [2022-04-15 12:17:22,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 12:17:22,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 12:17:22,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {19531#true} call ULTIMATE.init(); {19561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:22,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {19561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {19531#true} is VALID [2022-04-15 12:17:22,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 12:17:22,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 12:17:22,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {19531#true} call #t~ret5 := main(); {19531#true} is VALID [2022-04-15 12:17:22,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {19531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19536#(= main_~i~0 0)} is VALID [2022-04-15 12:17:22,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {19536#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19536#(= main_~i~0 0)} is VALID [2022-04-15 12:17:22,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {19536#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:22,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {19537#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:22,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {19537#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:22,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {19538#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:22,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {19538#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:22,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {19539#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:22,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {19539#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:22,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {19540#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:22,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {19540#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:22,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {19541#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:22,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {19541#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:22,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {19542#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:22,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {19542#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:22,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {19543#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:22,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {19543#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:22,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {19544#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:22,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {19544#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:22,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {19545#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:22,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {19545#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:22,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {19546#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:22,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {19546#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:22,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {19547#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:22,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {19547#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:22,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {19548#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:22,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {19548#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:22,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {19549#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:22,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {19549#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:22,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {19550#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:22,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {19550#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:22,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {19551#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:22,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {19551#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:22,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {19552#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:22,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {19552#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:22,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {19553#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:22,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {19553#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:22,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {19554#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:22,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {19554#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:22,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {19555#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:22,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {19555#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:22,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {19556#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:22,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {19556#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:22,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {19557#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:22,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {19557#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:22,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {19558#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:22,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {19558#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:22,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {19559#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:22,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {19559#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19560#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:22,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {19560#(<= main_~i~0 24)} assume !(~i~0 < 1023); {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 55: Hoare triple {19532#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {19532#false} assume !(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:22,227 INFO L272 TraceCheckUtils]: 64: Hoare triple {19532#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {19532#false} is VALID [2022-04-15 12:17:22,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {19532#false} ~cond := #in~cond; {19532#false} is VALID [2022-04-15 12:17:22,228 INFO L290 TraceCheckUtils]: 66: Hoare triple {19532#false} assume 0 == ~cond; {19532#false} is VALID [2022-04-15 12:17:22,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {19532#false} assume !false; {19532#false} is VALID [2022-04-15 12:17:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025191537] [2022-04-15 12:17:22,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025191537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667083788] [2022-04-15 12:17:22,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:22,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:22,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:22,230 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:22,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:17:22,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:22,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:22,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:17:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:22,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:22,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {19531#true} call ULTIMATE.init(); {19531#true} is VALID [2022-04-15 12:17:22,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {19531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {19531#true} is VALID [2022-04-15 12:17:22,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 12:17:22,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 12:17:22,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {19531#true} call #t~ret5 := main(); {19531#true} is VALID [2022-04-15 12:17:22,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {19531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19580#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:22,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {19580#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19580#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:22,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {19580#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:22,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {19537#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:22,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {19537#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:22,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {19538#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:22,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {19538#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:22,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {19539#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:22,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {19539#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:22,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {19540#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:22,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {19540#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:22,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {19541#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:22,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {19541#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:22,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {19542#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:22,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {19542#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:22,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {19543#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:23,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {19543#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:23,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {19544#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:23,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {19544#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:23,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {19545#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:23,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {19545#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:23,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {19546#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:23,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {19546#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:23,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {19547#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:23,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {19547#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:23,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {19548#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:23,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {19548#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:23,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {19549#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:23,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {19549#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:23,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {19550#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:23,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {19550#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:23,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {19551#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:23,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {19551#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:23,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {19552#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:23,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {19552#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:23,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {19553#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:23,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {19553#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:23,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {19554#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:23,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {19554#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:23,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {19555#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:23,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {19555#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:23,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {19556#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:23,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {19556#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:23,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {19557#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:23,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {19557#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:23,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {19558#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:23,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {19558#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:23,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {19559#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:23,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {19559#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19560#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:23,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {19560#(<= main_~i~0 24)} assume !(~i~0 < 1023); {19532#false} is VALID [2022-04-15 12:17:23,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {19532#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 59: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:23,015 INFO L290 TraceCheckUtils]: 63: Hoare triple {19532#false} assume !(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:23,017 INFO L272 TraceCheckUtils]: 64: Hoare triple {19532#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {19532#false} is VALID [2022-04-15 12:17:23,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {19532#false} ~cond := #in~cond; {19532#false} is VALID [2022-04-15 12:17:23,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {19532#false} assume 0 == ~cond; {19532#false} is VALID [2022-04-15 12:17:23,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {19532#false} assume !false; {19532#false} is VALID [2022-04-15 12:17:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:23,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:24,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {19532#false} assume !false; {19532#false} is VALID [2022-04-15 12:17:24,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {19532#false} assume 0 == ~cond; {19532#false} is VALID [2022-04-15 12:17:24,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {19532#false} ~cond := #in~cond; {19532#false} is VALID [2022-04-15 12:17:24,161 INFO L272 TraceCheckUtils]: 64: Hoare triple {19532#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {19532#false} is VALID [2022-04-15 12:17:24,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {19532#false} assume !(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:24,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {19532#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {19532#false} is VALID [2022-04-15 12:17:24,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {19806#(< main_~i~0 1023)} assume !(~i~0 < 1023); {19532#false} is VALID [2022-04-15 12:17:24,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {19810#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19806#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:24,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {19810#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19810#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:24,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {19817#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19810#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:24,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {19817#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19817#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:24,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {19824#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19817#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:24,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {19824#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19824#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:24,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {19831#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19824#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:24,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {19831#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19831#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:24,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {19838#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19831#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:24,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {19838#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19838#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:24,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {19845#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19838#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:24,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {19845#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19845#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:24,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {19852#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19845#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:24,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {19852#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19852#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:24,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {19859#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19852#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:24,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {19859#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19859#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:24,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {19866#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19859#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:24,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {19866#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19866#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:24,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {19873#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19866#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:24,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {19873#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19873#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:24,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {19880#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19873#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:24,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {19880#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19880#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:24,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {19887#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19880#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:24,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {19887#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19887#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:24,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {19894#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19887#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:24,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {19894#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19894#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:24,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {19901#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19894#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:24,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {19901#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19901#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:24,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {19908#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19901#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:24,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {19908#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19908#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:24,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {19915#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19908#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:24,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {19915#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19915#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:24,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {19922#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19915#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:24,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {19922#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19922#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:24,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {19929#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19922#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:24,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {19929#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19929#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:24,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {19936#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19929#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:24,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {19936#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19936#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:24,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {19943#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19936#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:24,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {19943#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19943#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:24,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {19950#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19943#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:24,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {19950#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19950#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:24,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19950#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:24,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {19957#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19957#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:24,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {19964#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19957#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:24,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {19964#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19964#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:24,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {19971#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19964#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:24,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {19971#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19971#(< main_~i~0 999)} is VALID [2022-04-15 12:17:24,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {19531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19971#(< main_~i~0 999)} is VALID [2022-04-15 12:17:24,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {19531#true} call #t~ret5 := main(); {19531#true} is VALID [2022-04-15 12:17:24,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 12:17:24,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 12:17:24,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {19531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {19531#true} is VALID [2022-04-15 12:17:24,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {19531#true} call ULTIMATE.init(); {19531#true} is VALID [2022-04-15 12:17:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667083788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:24,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 12:17:24,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:24,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1415943377] [2022-04-15 12:17:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1415943377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:17:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671421321] [2022-04-15 12:17:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:24,185 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 12:17:24,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:24,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,233 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-15 12:17:24,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:17:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:17:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:17:24,235 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,076 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2022-04-15 12:17:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:17:27,076 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 12:17:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 199 transitions. [2022-04-15 12:17:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 199 transitions. [2022-04-15 12:17:27,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 199 transitions. [2022-04-15 12:17:27,253 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-15 12:17:27,255 INFO L225 Difference]: With dead ends: 179 [2022-04-15 12:17:27,255 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 12:17:27,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:17:27,257 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 394 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:27,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 26 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 12:17:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 71. [2022-04-15 12:17:27,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:27,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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-15 12:17:27,537 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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-15 12:17:27,537 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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-15 12:17:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,539 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-04-15 12:17:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2022-04-15 12:17:27,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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 165 states. [2022-04-15 12:17:27,540 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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 165 states. [2022-04-15 12:17:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,543 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-04-15 12:17:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2022-04-15 12:17:27,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:27,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 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-15 12:17:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-15 12:17:27,544 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2022-04-15 12:17:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:27,545 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-15 12:17:27,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-15 12:17:27,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:17:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 12:17:27,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:27,661 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:27,688 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-15 12:17:27,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 12:17:27,882 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1406292607, now seen corresponding path program 51 times [2022-04-15 12:17:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:27,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598754927] [2022-04-15 12:17:27,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:27,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1406292607, now seen corresponding path program 52 times [2022-04-15 12:17:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:27,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531125581] [2022-04-15 12:17:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {20906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {20875#true} is VALID [2022-04-15 12:17:28,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 12:17:28,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 12:17:28,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {20875#true} call ULTIMATE.init(); {20906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:28,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {20906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {20875#true} is VALID [2022-04-15 12:17:28,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 12:17:28,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 12:17:28,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {20875#true} call #t~ret5 := main(); {20875#true} is VALID [2022-04-15 12:17:28,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {20875#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20880#(= main_~i~0 0)} is VALID [2022-04-15 12:17:28,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {20880#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20880#(= main_~i~0 0)} is VALID [2022-04-15 12:17:28,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {20880#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:28,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {20881#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:28,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {20881#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:28,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {20882#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:28,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {20882#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:28,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {20883#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:28,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {20883#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:28,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {20884#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:28,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {20884#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:28,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {20885#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:28,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {20885#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:28,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {20886#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:28,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {20886#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:28,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {20887#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:28,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {20887#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:28,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {20888#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:28,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {20888#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:28,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {20889#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:28,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {20889#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:28,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {20890#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:28,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {20890#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:28,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:28,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:28,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:28,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:28,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {20893#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:28,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {20893#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:28,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {20894#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:28,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {20894#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:28,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:28,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:28,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {20896#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:28,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {20896#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:28,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {20897#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:28,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {20897#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:28,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {20898#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:28,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {20898#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:28,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {20899#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:28,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {20899#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:28,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {20900#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:28,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {20900#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:28,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {20901#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:28,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {20901#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:28,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {20902#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:28,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {20902#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:28,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {20903#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:28,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {20903#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:28,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {20904#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:28,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {20904#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20905#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:28,547 INFO L290 TraceCheckUtils]: 56: Hoare triple {20905#(<= main_~i~0 25)} assume !(~i~0 < 1023); {20876#false} is VALID [2022-04-15 12:17:28,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 59: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {20876#false} assume !(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L272 TraceCheckUtils]: 66: Hoare triple {20876#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {20876#false} is VALID [2022-04-15 12:17:28,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {20876#false} ~cond := #in~cond; {20876#false} is VALID [2022-04-15 12:17:28,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {20876#false} assume 0 == ~cond; {20876#false} is VALID [2022-04-15 12:17:28,549 INFO L290 TraceCheckUtils]: 69: Hoare triple {20876#false} assume !false; {20876#false} is VALID [2022-04-15 12:17:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531125581] [2022-04-15 12:17:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531125581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142055164] [2022-04-15 12:17:28,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:28,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:28,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:28,552 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:28,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:17:28,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:28,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:28,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:17:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:29,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {20875#true} call ULTIMATE.init(); {20875#true} is VALID [2022-04-15 12:17:29,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {20875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {20875#true} is VALID [2022-04-15 12:17:29,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 12:17:29,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 12:17:29,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {20875#true} call #t~ret5 := main(); {20875#true} is VALID [2022-04-15 12:17:29,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {20875#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20925#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:29,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {20925#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20925#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:29,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {20925#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:29,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {20881#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:29,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {20881#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:29,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {20882#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:29,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {20882#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:29,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {20883#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:29,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {20883#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:29,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {20884#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:29,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {20884#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:29,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {20885#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:29,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {20885#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:29,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {20886#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:29,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {20886#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:29,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {20887#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:29,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {20887#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:29,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {20888#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:29,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {20888#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:29,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {20889#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:29,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {20889#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:29,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {20890#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:29,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {20890#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:29,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:29,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:29,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:29,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:29,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {20893#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:29,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {20893#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:29,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {20894#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:29,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {20894#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:29,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:29,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:29,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {20896#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:29,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {20896#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:29,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {20897#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:29,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {20897#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:29,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {20898#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:29,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {20898#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:29,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {20899#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:29,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {20899#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:29,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {20900#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:29,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {20900#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:29,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {20901#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:29,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {20901#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:29,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {20902#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:29,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {20902#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:29,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {20903#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:29,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {20903#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:29,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {20904#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:29,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {20904#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20905#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:29,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {20905#(<= main_~i~0 25)} assume !(~i~0 < 1023); {20876#false} is VALID [2022-04-15 12:17:29,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 59: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 65: Hoare triple {20876#false} assume !(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L272 TraceCheckUtils]: 66: Hoare triple {20876#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {20876#false} is VALID [2022-04-15 12:17:29,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {20876#false} ~cond := #in~cond; {20876#false} is VALID [2022-04-15 12:17:29,369 INFO L290 TraceCheckUtils]: 68: Hoare triple {20876#false} assume 0 == ~cond; {20876#false} is VALID [2022-04-15 12:17:29,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {20876#false} assume !false; {20876#false} is VALID [2022-04-15 12:17:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:29,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:30,655 INFO L290 TraceCheckUtils]: 69: Hoare triple {20876#false} assume !false; {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {20876#false} assume 0 == ~cond; {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {20876#false} ~cond := #in~cond; {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L272 TraceCheckUtils]: 66: Hoare triple {20876#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {20876#false} assume !(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:30,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:30,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 12:17:30,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 12:17:30,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 12:17:30,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {20876#false} is VALID [2022-04-15 12:17:30,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {21157#(< main_~i~0 1023)} assume !(~i~0 < 1023); {20876#false} is VALID [2022-04-15 12:17:30,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {21161#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21157#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:30,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {21161#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21161#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:30,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {21168#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21161#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:30,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {21168#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21168#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:30,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {21175#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21168#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:30,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {21175#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21175#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:30,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {21182#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21175#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:30,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {21182#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21182#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:30,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {21189#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21182#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:30,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {21189#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21189#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:30,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {21196#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21189#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:30,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {21196#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21196#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:30,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {21203#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21196#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:30,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {21203#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21203#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:30,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {21210#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21203#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:30,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {21210#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21210#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:30,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {21217#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21210#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:30,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {21217#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21217#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:30,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {21224#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21217#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:30,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {21224#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21224#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:30,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {21231#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21224#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:30,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {21231#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21231#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:30,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {21238#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21231#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:30,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {21238#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21238#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:30,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {21245#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21238#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:30,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {21245#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21245#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:30,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {21252#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21245#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:30,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {21252#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21252#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:30,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {21259#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21252#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:30,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {21259#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21259#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:30,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {21266#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21259#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:30,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {21266#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21266#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:30,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {21273#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21266#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:30,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {21273#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21273#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:30,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {21280#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21273#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:30,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {21280#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21280#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:30,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {21287#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21280#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:30,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {21287#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21287#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:30,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {21294#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21287#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:30,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {21294#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21294#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:30,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {21301#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21294#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:30,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {21301#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21301#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:30,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {21308#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21301#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:30,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {21308#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21308#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:30,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {21315#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21308#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:30,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {21315#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21315#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:30,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {21322#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21315#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:30,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {21322#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21322#(< main_~i~0 999)} is VALID [2022-04-15 12:17:30,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {21329#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21322#(< main_~i~0 999)} is VALID [2022-04-15 12:17:30,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {21329#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21329#(< main_~i~0 998)} is VALID [2022-04-15 12:17:30,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {20875#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21329#(< main_~i~0 998)} is VALID [2022-04-15 12:17:30,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {20875#true} call #t~ret5 := main(); {20875#true} is VALID [2022-04-15 12:17:30,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 12:17:30,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 12:17:30,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {20875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {20875#true} is VALID [2022-04-15 12:17:30,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {20875#true} call ULTIMATE.init(); {20875#true} is VALID [2022-04-15 12:17:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:30,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142055164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:30,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:30,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 12:17:30,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:30,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598754927] [2022-04-15 12:17:30,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598754927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:30,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:30,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:17:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495379526] [2022-04-15 12:17:30,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 12:17:30,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:30,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,744 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-15 12:17:30,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:17:30,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:17:30,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:17:30,746 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:33,611 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2022-04-15 12:17:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:17:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 12:17:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 206 transitions. [2022-04-15 12:17:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 206 transitions. [2022-04-15 12:17:33,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 206 transitions. [2022-04-15 12:17:33,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:33,847 INFO L225 Difference]: With dead ends: 185 [2022-04-15 12:17:33,847 INFO L226 Difference]: Without dead ends: 171 [2022-04-15 12:17:33,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:17:33,849 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 370 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:33,849 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 31 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-15 12:17:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 73. [2022-04-15 12:17:34,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:34,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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-15 12:17:34,170 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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-15 12:17:34,171 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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-15 12:17:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,174 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2022-04-15 12:17:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-04-15 12:17:34,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:34,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:34,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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 171 states. [2022-04-15 12:17:34,175 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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 171 states. [2022-04-15 12:17:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,179 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2022-04-15 12:17:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-04-15 12:17:34,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:34,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:34,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:34,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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-15 12:17:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-04-15 12:17:34,181 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2022-04-15 12:17:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:34,182 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-04-15 12:17:34,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 74 transitions. [2022-04-15 12:17:34,300 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-15 12:17:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 12:17:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 12:17:34,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:34,316 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:34,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:34,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 12:17:34,532 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -294842333, now seen corresponding path program 53 times [2022-04-15 12:17:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993367322] [2022-04-15 12:17:34,537 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:34,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -294842333, now seen corresponding path program 54 times [2022-04-15 12:17:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:34,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370564054] [2022-04-15 12:17:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {22295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {22263#true} is VALID [2022-04-15 12:17:35,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 12:17:35,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 12:17:35,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {22263#true} call ULTIMATE.init(); {22295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:35,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {22295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {22263#true} is VALID [2022-04-15 12:17:35,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 12:17:35,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 12:17:35,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {22263#true} call #t~ret5 := main(); {22263#true} is VALID [2022-04-15 12:17:35,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {22263#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22268#(= main_~i~0 0)} is VALID [2022-04-15 12:17:35,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {22268#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22268#(= main_~i~0 0)} is VALID [2022-04-15 12:17:35,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {22268#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {22269#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {22269#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {22270#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {22270#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22271#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:35,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {22271#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22271#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:35,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {22271#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22272#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:35,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {22272#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22272#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:35,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {22272#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22273#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:35,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {22273#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22273#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:35,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {22273#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22274#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:35,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {22274#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22274#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:35,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {22274#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22275#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:35,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {22275#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22275#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:35,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {22275#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22276#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:35,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {22276#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22276#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:35,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {22276#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22277#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:35,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {22277#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22277#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:35,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {22277#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22278#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:35,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {22278#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22278#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:35,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {22278#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22279#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:35,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {22279#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22279#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:35,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {22279#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22280#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:35,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {22280#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22280#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:35,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {22280#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22281#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:35,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {22281#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22281#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:35,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {22281#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22282#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:35,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {22282#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22282#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:35,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {22282#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22283#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:35,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {22283#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22283#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:35,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {22283#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22284#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:35,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {22284#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22284#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:35,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {22284#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22285#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:35,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {22285#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22285#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:35,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {22285#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22286#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:35,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {22286#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22286#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:35,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {22286#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22287#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:35,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {22287#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22287#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:35,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {22287#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22288#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:35,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {22288#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22288#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:35,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {22288#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22289#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:35,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {22289#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22289#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:35,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {22289#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22290#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:35,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {22290#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22290#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:35,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {22290#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22291#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:35,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {22291#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22291#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:35,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {22291#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22292#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:35,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {22292#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22292#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:35,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {22292#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22293#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:35,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {22293#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22293#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:35,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {22293#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22294#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {22294#(<= main_~i~0 26)} assume !(~i~0 < 1023); {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {22264#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {22264#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {22264#false} assume !!(0 != #t~mem4);havoc #t~mem4; {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {22264#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {22264#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {22264#false} assume !!(0 != #t~mem4);havoc #t~mem4; {22264#false} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {22264#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22264#false} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {22264#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22264#false} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {22264#false} assume !(0 != #t~mem4);havoc #t~mem4; {22264#false} is VALID [2022-04-15 12:17:35,135 INFO L272 TraceCheckUtils]: 68: Hoare triple {22264#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {22264#false} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {22264#false} ~cond := #in~cond; {22264#false} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {22264#false} assume 0 == ~cond; {22264#false} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {22264#false} assume !false; {22264#false} is VALID [2022-04-15 12:17:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:35,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370564054] [2022-04-15 12:17:35,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370564054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721629373] [2022-04-15 12:17:35,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:35,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:35,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:35,140 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:35,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:17:35,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:35,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:35,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:35,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {22263#true} call ULTIMATE.init(); {22263#true} is VALID [2022-04-15 12:17:35,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {22263#true} is VALID [2022-04-15 12:17:35,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 12:17:35,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 12:17:35,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {22263#true} call #t~ret5 := main(); {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {22263#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {22263#true} assume !(~i~0 < 1023); {22263#true} is VALID [2022-04-15 12:17:35,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {22263#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {22476#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:35,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {22476#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22476#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:35,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {22476#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {22476#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:35,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {22476#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {22269#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22269#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {22269#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {22269#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {22270#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22270#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {22270#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,596 INFO L272 TraceCheckUtils]: 68: Hoare triple {22270#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:35,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22508#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:35,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {22508#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22264#false} is VALID [2022-04-15 12:17:35,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {22264#false} assume !false; {22264#false} is VALID [2022-04-15 12:17:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 12:17:35,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:35,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {22264#false} assume !false; {22264#false} is VALID [2022-04-15 12:17:35,870 INFO L290 TraceCheckUtils]: 70: Hoare triple {22508#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22264#false} is VALID [2022-04-15 12:17:35,870 INFO L290 TraceCheckUtils]: 69: Hoare triple {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22508#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:35,871 INFO L272 TraceCheckUtils]: 68: Hoare triple {22524#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:35,871 INFO L290 TraceCheckUtils]: 67: Hoare triple {22524#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {22524#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:35,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {22524#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22524#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:35,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {22534#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22524#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:35,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {22534#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {22534#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:35,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {22534#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22534#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:35,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {22544#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22534#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:35,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {22544#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {22544#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:35,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {22544#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22544#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:35,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {22263#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {22544#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 58: Hoare triple {22263#true} assume !(~i~0 < 1023); {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {22263#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22263#true} is VALID [2022-04-15 12:17:35,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {22263#true} call #t~ret5 := main(); {22263#true} is VALID [2022-04-15 12:17:35,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 12:17:35,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 12:17:35,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {22263#true} is VALID [2022-04-15 12:17:35,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {22263#true} call ULTIMATE.init(); {22263#true} is VALID [2022-04-15 12:17:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 12:17:35,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721629373] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:35,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:35,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 36 [2022-04-15 12:17:35,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:35,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993367322] [2022-04-15 12:17:35,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993367322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:35,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:35,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:17:35,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769990727] [2022-04-15 12:17:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 12:17:35,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:35,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:35,938 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-15 12:17:35,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:17:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:17:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=726, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:17:35,940 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:38,966 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2022-04-15 12:17:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:17:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 12:17:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 213 transitions. [2022-04-15 12:17:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 213 transitions. [2022-04-15 12:17:38,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 213 transitions. [2022-04-15 12:17:39,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:39,176 INFO L225 Difference]: With dead ends: 191 [2022-04-15 12:17:39,176 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 12:17:39,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1426, Invalid=2480, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:17:39,177 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 324 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:39,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 46 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 12:17:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 75. [2022-04-15 12:17:39,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:39,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 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-15 12:17:39,506 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 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-15 12:17:39,506 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 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-15 12:17:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:39,508 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2022-04-15 12:17:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2022-04-15 12:17:39,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:39,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:39,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 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 177 states. [2022-04-15 12:17:39,509 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 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 177 states. [2022-04-15 12:17:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:39,517 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2022-04-15 12:17:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2022-04-15 12:17:39,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:39,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:39,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:39,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 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-15 12:17:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-04-15 12:17:39,519 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2022-04-15 12:17:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:39,519 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-04-15 12:17:39,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:39,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 76 transitions. [2022-04-15 12:17:39,636 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-15 12:17:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-04-15 12:17:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:17:39,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:39,637 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:39,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:39,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:39,850 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1637985723, now seen corresponding path program 55 times [2022-04-15 12:17:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:39,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276546393] [2022-04-15 12:17:39,856 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:39,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1637985723, now seen corresponding path program 56 times [2022-04-15 12:17:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392874949] [2022-04-15 12:17:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:40,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {23706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23673#true} is VALID [2022-04-15 12:17:40,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 12:17:40,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 12:17:40,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {23673#true} call ULTIMATE.init(); {23706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:40,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {23706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23673#true} is VALID [2022-04-15 12:17:40,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 12:17:40,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 12:17:40,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {23673#true} call #t~ret5 := main(); {23673#true} is VALID [2022-04-15 12:17:40,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {23673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23678#(= main_~i~0 0)} is VALID [2022-04-15 12:17:40,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {23678#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23678#(= main_~i~0 0)} is VALID [2022-04-15 12:17:40,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {23678#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:40,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {23679#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:40,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {23679#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:40,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {23680#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:40,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {23680#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:40,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {23681#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:40,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {23681#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:40,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {23682#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:40,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {23682#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:40,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {23683#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:40,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {23683#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:40,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {23684#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:40,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {23684#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:40,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {23685#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:40,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {23685#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:40,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {23686#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:40,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {23686#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:40,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {23687#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:40,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {23687#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:40,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {23688#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:40,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {23688#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:40,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {23689#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:40,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {23689#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:40,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {23690#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:40,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {23690#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:40,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {23691#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:40,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {23691#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:40,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {23692#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:40,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {23692#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:40,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {23693#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:40,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {23693#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:40,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {23694#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:40,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {23694#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:40,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {23695#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:40,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {23695#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:40,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {23696#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:40,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {23696#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:40,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {23697#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:40,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {23697#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:40,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {23698#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:40,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {23698#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:40,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {23699#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:40,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {23699#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:40,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {23700#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:40,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {23700#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:40,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {23701#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:40,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {23701#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:40,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {23702#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:40,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {23702#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:40,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {23703#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:40,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {23703#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:40,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {23704#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:40,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {23704#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23705#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:40,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {23705#(<= main_~i~0 27)} assume !(~i~0 < 1023); {23674#false} is VALID [2022-04-15 12:17:40,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {23674#false} is VALID [2022-04-15 12:17:40,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:40,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:40,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {23674#false} assume !(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L272 TraceCheckUtils]: 70: Hoare triple {23674#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {23674#false} ~cond := #in~cond; {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {23674#false} assume 0 == ~cond; {23674#false} is VALID [2022-04-15 12:17:40,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {23674#false} assume !false; {23674#false} is VALID [2022-04-15 12:17:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:40,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392874949] [2022-04-15 12:17:40,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392874949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:40,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858191016] [2022-04-15 12:17:40,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:40,413 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:40,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:17:40,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:40,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:40,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:17:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:40,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:41,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {23673#true} call ULTIMATE.init(); {23673#true} is VALID [2022-04-15 12:17:41,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {23673#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23673#true} is VALID [2022-04-15 12:17:41,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 12:17:41,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 12:17:41,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {23673#true} call #t~ret5 := main(); {23673#true} is VALID [2022-04-15 12:17:41,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {23673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23725#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:41,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {23725#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23725#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:41,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {23725#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:41,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {23679#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:41,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {23679#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:41,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {23680#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:41,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {23680#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:41,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {23681#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:41,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {23681#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:41,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {23682#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:41,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {23682#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:41,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {23683#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:41,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {23683#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:41,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {23684#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:41,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {23684#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:41,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {23685#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:41,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {23685#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:41,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {23686#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:41,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {23686#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:41,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {23687#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:41,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {23687#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:41,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {23688#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:41,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {23688#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:41,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {23689#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:41,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {23689#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:41,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {23690#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:41,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {23690#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:41,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {23691#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:41,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {23691#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:41,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {23692#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:41,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {23692#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:41,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {23693#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:41,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {23693#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:41,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {23694#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:41,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {23694#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:41,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {23695#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:41,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {23695#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:41,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {23696#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:41,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {23696#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:41,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {23697#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:41,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {23697#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:41,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {23698#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:41,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {23698#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:41,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {23699#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:41,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {23699#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:41,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {23700#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:41,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {23700#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:41,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {23701#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:41,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {23701#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:41,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {23702#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:41,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {23702#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:41,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {23703#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:41,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {23703#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:41,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {23704#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:41,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {23704#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23705#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {23705#(<= main_~i~0 27)} assume !(~i~0 < 1023); {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 65: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:41,144 INFO L290 TraceCheckUtils]: 67: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 12:17:41,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:41,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {23674#false} assume !(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:41,145 INFO L272 TraceCheckUtils]: 70: Hoare triple {23674#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {23674#false} is VALID [2022-04-15 12:17:41,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {23674#false} ~cond := #in~cond; {23674#false} is VALID [2022-04-15 12:17:41,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {23674#false} assume 0 == ~cond; {23674#false} is VALID [2022-04-15 12:17:41,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {23674#false} assume !false; {23674#false} is VALID [2022-04-15 12:17:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:41,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:42,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {23674#false} assume !false; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {23674#false} assume 0 == ~cond; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {23674#false} ~cond := #in~cond; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L272 TraceCheckUtils]: 70: Hoare triple {23674#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {23674#false} assume !(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 12:17:42,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 12:17:42,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 12:17:42,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {23674#false} is VALID [2022-04-15 12:17:42,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {23969#(< main_~i~0 1023)} assume !(~i~0 < 1023); {23674#false} is VALID [2022-04-15 12:17:42,512 INFO L290 TraceCheckUtils]: 59: Hoare triple {23973#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23969#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:42,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {23973#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23973#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:42,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {23980#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23973#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:42,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {23980#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23980#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:42,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {23987#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23980#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:42,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {23987#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23987#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:42,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {23994#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23987#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:42,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {23994#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23994#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:42,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {24001#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23994#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:42,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {24001#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24001#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:42,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {24008#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24001#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:42,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {24008#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24008#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:42,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {24015#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24008#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:42,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {24015#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24015#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:42,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {24022#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24015#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:42,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {24022#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24022#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:42,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {24029#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24022#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:42,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {24029#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24029#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:42,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {24036#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24029#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:42,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {24036#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24036#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:42,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {24043#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24036#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:42,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {24043#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24043#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:42,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {24050#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24043#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:42,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {24050#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24050#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:42,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {24057#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24050#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:42,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {24057#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24057#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:42,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {24064#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24057#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:42,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {24064#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24064#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:42,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {24071#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24064#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:42,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {24071#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24071#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:42,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {24078#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24071#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:42,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {24078#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24078#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:42,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {24085#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24078#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:42,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {24085#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24085#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:42,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {24092#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24085#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:42,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {24092#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24092#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:42,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {24099#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24092#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:42,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {24099#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24099#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:42,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {24106#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24099#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:42,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {24106#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24106#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:42,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {24113#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24106#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:42,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {24113#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24113#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:42,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {24120#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24113#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:42,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {24120#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24120#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:42,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {24127#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24120#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:42,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {24127#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24127#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:42,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {24134#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24127#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:42,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {24134#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24134#(< main_~i~0 999)} is VALID [2022-04-15 12:17:42,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {24141#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24134#(< main_~i~0 999)} is VALID [2022-04-15 12:17:42,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {24141#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24141#(< main_~i~0 998)} is VALID [2022-04-15 12:17:42,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {24148#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24141#(< main_~i~0 998)} is VALID [2022-04-15 12:17:42,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {24148#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24148#(< main_~i~0 997)} is VALID [2022-04-15 12:17:42,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {24155#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24148#(< main_~i~0 997)} is VALID [2022-04-15 12:17:42,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {24155#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24155#(< main_~i~0 996)} is VALID [2022-04-15 12:17:42,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {23673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24155#(< main_~i~0 996)} is VALID [2022-04-15 12:17:42,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {23673#true} call #t~ret5 := main(); {23673#true} is VALID [2022-04-15 12:17:42,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 12:17:42,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 12:17:42,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {23673#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23673#true} is VALID [2022-04-15 12:17:42,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {23673#true} call ULTIMATE.init(); {23673#true} is VALID [2022-04-15 12:17:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:42,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858191016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:42,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:42,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 12:17:42,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:42,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276546393] [2022-04-15 12:17:42,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276546393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:42,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:42,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:17:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444696471] [2022-04-15 12:17:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 12:17:42,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:42,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:42,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:42,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:17:42,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:42,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:17:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:17:42,597 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,728 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2022-04-15 12:17:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:17:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 12:17:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 220 transitions. [2022-04-15 12:17:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 220 transitions. [2022-04-15 12:17:45,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 220 transitions. [2022-04-15 12:17:45,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:45,958 INFO L225 Difference]: With dead ends: 197 [2022-04-15 12:17:45,958 INFO L226 Difference]: Without dead ends: 183 [2022-04-15 12:17:45,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 12:17:45,959 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 410 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:45,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 41 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-15 12:17:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 77. [2022-04-15 12:17:46,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:46,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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-15 12:17:46,239 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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-15 12:17:46,240 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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-15 12:17:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,247 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-04-15 12:17:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2022-04-15 12:17:46,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:46,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:46,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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 183 states. [2022-04-15 12:17:46,248 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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 183 states. [2022-04-15 12:17:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,251 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-04-15 12:17:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2022-04-15 12:17:46,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:46,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:46,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:46,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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-15 12:17:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-15 12:17:46,252 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2022-04-15 12:17:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:46,253 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-15 12:17:46,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-15 12:17:46,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:17:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 12:17:46,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:46,402 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:46,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:46,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:46,604 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash 386372583, now seen corresponding path program 57 times [2022-04-15 12:17:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:46,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207501144] [2022-04-15 12:17:46,687 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:46,687 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash 386372583, now seen corresponding path program 58 times [2022-04-15 12:17:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:46,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972108356] [2022-04-15 12:17:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {25149#true} is VALID [2022-04-15 12:17:47,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 12:17:47,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 12:17:47,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {25149#true} call ULTIMATE.init(); {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:47,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {25149#true} is VALID [2022-04-15 12:17:47,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 12:17:47,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 12:17:47,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {25149#true} call #t~ret5 := main(); {25149#true} is VALID [2022-04-15 12:17:47,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {25149#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {25154#(= main_~i~0 0)} is VALID [2022-04-15 12:17:47,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {25154#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25154#(= main_~i~0 0)} is VALID [2022-04-15 12:17:47,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {25154#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:47,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {25155#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:47,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {25155#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:47,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {25156#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:47,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {25156#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:47,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {25157#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:47,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {25157#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:47,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {25158#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:47,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {25158#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:47,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {25159#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:47,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {25159#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:47,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {25160#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:47,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {25160#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:47,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {25161#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:47,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {25161#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:47,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {25162#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:47,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {25162#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:47,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:47,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {25163#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:47,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {25164#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:47,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {25164#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:47,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {25165#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:47,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {25165#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:47,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {25166#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:47,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {25166#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:47,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {25167#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:47,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {25167#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:47,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {25168#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:47,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {25168#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:47,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {25169#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:47,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {25169#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:47,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {25170#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:47,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {25170#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:47,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {25171#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:47,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {25171#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:47,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {25172#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:47,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {25172#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:47,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {25173#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:47,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {25173#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:47,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {25174#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:47,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {25174#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:47,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {25175#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:47,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {25175#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:47,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {25176#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:47,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {25176#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:47,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {25177#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:47,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {25177#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:47,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {25178#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:47,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {25178#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:47,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {25179#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:47,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {25179#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:47,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {25180#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:47,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {25180#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:47,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {25181#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:47,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {25181#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25182#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:47,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {25182#(<= main_~i~0 28)} assume !(~i~0 < 1023); {25150#false} is VALID [2022-04-15 12:17:47,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {25150#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {25150#false} is VALID [2022-04-15 12:17:47,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:47,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 67: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 68: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 69: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {25150#false} assume !(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L272 TraceCheckUtils]: 72: Hoare triple {25150#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 73: Hoare triple {25150#false} ~cond := #in~cond; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 74: Hoare triple {25150#false} assume 0 == ~cond; {25150#false} is VALID [2022-04-15 12:17:47,243 INFO L290 TraceCheckUtils]: 75: Hoare triple {25150#false} assume !false; {25150#false} is VALID [2022-04-15 12:17:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:47,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972108356] [2022-04-15 12:17:47,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972108356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:47,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406255964] [2022-04-15 12:17:47,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:47,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:47,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:47,245 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:47,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 12:17:47,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:47,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:47,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:17:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:48,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {25149#true} call ULTIMATE.init(); {25149#true} is VALID [2022-04-15 12:17:48,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {25149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {25149#true} is VALID [2022-04-15 12:17:48,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 12:17:48,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 12:17:48,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {25149#true} call #t~ret5 := main(); {25149#true} is VALID [2022-04-15 12:17:48,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {25149#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {25202#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:48,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {25202#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25202#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:48,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {25202#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:48,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {25155#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:48,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {25155#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:48,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {25156#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:48,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {25156#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:48,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {25157#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:48,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {25157#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:48,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {25158#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:48,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {25158#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:48,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {25159#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:48,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {25159#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:48,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {25160#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:48,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {25160#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:48,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {25161#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:48,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {25161#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:48,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {25162#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:48,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {25162#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:48,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:48,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {25163#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:48,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {25164#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:48,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {25164#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:48,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {25165#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:48,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {25165#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:48,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {25166#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:48,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {25166#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:48,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {25167#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:48,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {25167#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:48,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {25168#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:48,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {25168#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:48,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {25169#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:48,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {25169#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:48,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {25170#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:48,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {25170#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:48,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {25171#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:48,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {25171#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:48,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {25172#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:48,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {25172#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:48,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {25173#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:48,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {25173#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:48,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {25174#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:48,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {25174#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:48,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {25175#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:48,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {25175#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:48,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {25176#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:48,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {25176#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:48,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {25177#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:48,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {25177#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:48,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {25178#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:48,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {25178#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:48,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {25179#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:48,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {25179#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:48,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {25180#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:48,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {25180#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:48,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {25181#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:48,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {25181#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25182#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {25182#(<= main_~i~0 28)} assume !(~i~0 < 1023); {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {25150#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 67: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 12:17:48,046 INFO L290 TraceCheckUtils]: 70: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:48,047 INFO L290 TraceCheckUtils]: 71: Hoare triple {25150#false} assume !(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:48,047 INFO L272 TraceCheckUtils]: 72: Hoare triple {25150#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {25150#false} is VALID [2022-04-15 12:17:48,047 INFO L290 TraceCheckUtils]: 73: Hoare triple {25150#false} ~cond := #in~cond; {25150#false} is VALID [2022-04-15 12:17:48,047 INFO L290 TraceCheckUtils]: 74: Hoare triple {25150#false} assume 0 == ~cond; {25150#false} is VALID [2022-04-15 12:17:48,047 INFO L290 TraceCheckUtils]: 75: Hoare triple {25150#false} assume !false; {25150#false} is VALID [2022-04-15 12:17:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:48,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:49,594 INFO L290 TraceCheckUtils]: 75: Hoare triple {25150#false} assume !false; {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {25150#false} assume 0 == ~cond; {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {25150#false} ~cond := #in~cond; {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L272 TraceCheckUtils]: 72: Hoare triple {25150#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {25150#false} assume !(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:49,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:49,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 12:17:49,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 12:17:49,596 INFO L290 TraceCheckUtils]: 64: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 12:17:49,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {25150#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {25150#false} is VALID [2022-04-15 12:17:49,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {25452#(< main_~i~0 1023)} assume !(~i~0 < 1023); {25150#false} is VALID [2022-04-15 12:17:49,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {25456#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25452#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:49,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {25456#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25456#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:49,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {25463#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25456#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:49,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {25463#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25463#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:49,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {25470#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25463#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:49,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {25470#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25470#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:49,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {25477#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25470#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:49,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {25477#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25477#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:49,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {25484#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25477#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:49,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {25484#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25484#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:49,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {25491#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25484#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:49,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {25491#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25491#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:49,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {25498#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25491#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:49,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {25498#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25498#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:49,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {25505#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25498#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:49,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {25505#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25505#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:49,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {25512#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25505#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:49,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {25512#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25512#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:49,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {25519#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25512#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:49,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {25519#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25519#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:49,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {25526#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25519#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:49,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {25526#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25526#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:49,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {25533#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25526#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:49,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {25533#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25533#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:49,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {25540#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25533#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:49,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {25540#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25540#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:49,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {25547#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25540#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:49,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {25547#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25547#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:49,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {25554#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25547#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:49,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {25554#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25554#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:49,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {25561#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25554#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:49,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {25561#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25561#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:49,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {25568#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25561#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:49,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {25568#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25568#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:49,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {25575#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25568#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:49,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {25575#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25575#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:49,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {25582#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25575#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:49,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {25582#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25582#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:49,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25582#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:49,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25589#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:49,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {25596#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25589#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:49,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {25596#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25596#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:49,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {25603#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25596#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:49,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {25603#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25603#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:49,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {25610#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25603#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:49,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {25610#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25610#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:49,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {25617#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25610#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:49,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {25617#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25617#(< main_~i~0 999)} is VALID [2022-04-15 12:17:49,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {25624#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25617#(< main_~i~0 999)} is VALID [2022-04-15 12:17:49,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {25624#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25624#(< main_~i~0 998)} is VALID [2022-04-15 12:17:49,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {25631#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25624#(< main_~i~0 998)} is VALID [2022-04-15 12:17:49,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {25631#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25631#(< main_~i~0 997)} is VALID [2022-04-15 12:17:49,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {25638#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25631#(< main_~i~0 997)} is VALID [2022-04-15 12:17:49,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {25638#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25638#(< main_~i~0 996)} is VALID [2022-04-15 12:17:49,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {25645#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25638#(< main_~i~0 996)} is VALID [2022-04-15 12:17:49,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {25645#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25645#(< main_~i~0 995)} is VALID [2022-04-15 12:17:49,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {25149#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {25645#(< main_~i~0 995)} is VALID [2022-04-15 12:17:49,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {25149#true} call #t~ret5 := main(); {25149#true} is VALID [2022-04-15 12:17:49,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 12:17:49,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 12:17:49,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {25149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {25149#true} is VALID [2022-04-15 12:17:49,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {25149#true} call ULTIMATE.init(); {25149#true} is VALID [2022-04-15 12:17:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406255964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:49,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 12:17:49,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:49,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207501144] [2022-04-15 12:17:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207501144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:49,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:49,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:17:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469507016] [2022-04-15 12:17:49,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:49,623 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 12:17:49,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:49,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:49,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:49,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:17:49,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:49,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:17:49,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 12:17:49,676 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,883 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2022-04-15 12:17:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:17:52,883 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 12:17:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 227 transitions. [2022-04-15 12:17:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 227 transitions. [2022-04-15 12:17:52,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 227 transitions. [2022-04-15 12:17:53,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:53,057 INFO L225 Difference]: With dead ends: 203 [2022-04-15 12:17:53,057 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 12:17:53,059 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:17:53,059 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 350 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:53,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 56 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 12:17:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 79. [2022-04-15 12:17:53,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:53,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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-15 12:17:53,348 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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-15 12:17:53,349 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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-15 12:17:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:53,351 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-04-15 12:17:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2022-04-15 12:17:53,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:53,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:53,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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 189 states. [2022-04-15 12:17:53,352 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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 189 states. [2022-04-15 12:17:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:53,354 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-04-15 12:17:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2022-04-15 12:17:53,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:53,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:53,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:53,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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-15 12:17:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 12:17:53,356 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2022-04-15 12:17:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:53,357 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 12:17:53,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:53,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 12:17:53,475 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-15 12:17:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:17:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 12:17:53,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:53,476 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:53,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 12:17:53,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-15 12:17:53,695 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:53,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash 174519561, now seen corresponding path program 59 times [2022-04-15 12:17:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:53,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [906720366] [2022-04-15 12:17:53,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:53,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 174519561, now seen corresponding path program 60 times [2022-04-15 12:17:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:53,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454558894] [2022-04-15 12:17:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:54,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {26704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {26669#true} is VALID [2022-04-15 12:17:54,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 12:17:54,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 12:17:54,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {26669#true} call ULTIMATE.init(); {26704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:54,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {26704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {26669#true} is VALID [2022-04-15 12:17:54,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 12:17:54,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 12:17:54,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {26669#true} call #t~ret5 := main(); {26669#true} is VALID [2022-04-15 12:17:54,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {26669#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26674#(= main_~i~0 0)} is VALID [2022-04-15 12:17:54,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {26674#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26674#(= main_~i~0 0)} is VALID [2022-04-15 12:17:54,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {26674#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:54,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {26675#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:54,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {26675#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:54,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {26676#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:54,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {26676#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26677#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:54,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {26677#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26677#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:54,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {26677#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26678#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:54,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {26678#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26678#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:54,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {26678#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26679#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:54,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {26679#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26679#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:54,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {26679#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26680#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {26680#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26680#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:54,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {26680#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26681#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:54,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {26681#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26681#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:54,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {26681#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26682#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:54,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {26682#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26682#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:54,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {26682#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26683#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:54,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {26683#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26683#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:54,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {26683#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26684#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:54,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {26684#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26684#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:54,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {26684#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26685#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:54,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {26685#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26685#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:54,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {26685#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26686#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:54,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {26686#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26686#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:54,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {26686#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26687#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:54,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {26687#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26687#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:54,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {26687#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26688#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:54,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {26688#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26688#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:54,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {26688#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26689#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:54,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {26689#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26689#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:54,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {26689#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26690#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:54,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {26690#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26690#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:54,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {26690#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26691#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:54,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {26691#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26691#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:54,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {26691#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26692#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:54,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {26692#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26692#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:54,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {26692#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26693#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:54,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {26693#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26693#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:54,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {26693#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26694#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:54,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {26694#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26694#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:54,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {26694#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26695#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:54,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {26695#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26695#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:54,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {26695#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26696#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:54,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {26696#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26696#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:54,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {26696#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26697#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:54,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {26697#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26697#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:54,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {26697#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26698#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:54,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {26698#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26698#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:54,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {26698#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26699#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:54,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {26699#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26699#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:54,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {26699#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26700#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:54,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {26700#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26700#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:54,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {26700#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26701#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:54,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {26701#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26701#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:54,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {26701#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26702#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:54,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {26702#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26702#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:54,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {26702#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26703#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:54,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {26703#(<= main_~i~0 29)} assume !(~i~0 < 1023); {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {26670#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {26670#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {26670#false} assume !!(0 != #t~mem4);havoc #t~mem4; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {26670#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {26670#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {26670#false} assume !!(0 != #t~mem4);havoc #t~mem4; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 71: Hoare triple {26670#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {26670#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {26670#false} assume !(0 != #t~mem4);havoc #t~mem4; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L272 TraceCheckUtils]: 74: Hoare triple {26670#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {26670#false} ~cond := #in~cond; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 76: Hoare triple {26670#false} assume 0 == ~cond; {26670#false} is VALID [2022-04-15 12:17:54,218 INFO L290 TraceCheckUtils]: 77: Hoare triple {26670#false} assume !false; {26670#false} is VALID [2022-04-15 12:17:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:54,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:54,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454558894] [2022-04-15 12:17:54,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454558894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:54,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109773897] [2022-04-15 12:17:54,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:54,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:54,221 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:54,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 12:17:54,369 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:54,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:54,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:54,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:54,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {26669#true} call ULTIMATE.init(); {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {26669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {26669#true} call #t~ret5 := main(); {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {26669#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 62: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 63: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {26669#true} assume !(~i~0 < 1023); {26669#true} is VALID [2022-04-15 12:17:54,625 INFO L290 TraceCheckUtils]: 65: Hoare triple {26669#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {26903#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:54,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {26903#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26903#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:54,626 INFO L290 TraceCheckUtils]: 67: Hoare triple {26903#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {26903#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:54,626 INFO L290 TraceCheckUtils]: 68: Hoare triple {26903#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:54,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {26675#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26675#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:54,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {26675#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:54,627 INFO L290 TraceCheckUtils]: 71: Hoare triple {26675#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:54,628 INFO L290 TraceCheckUtils]: 72: Hoare triple {26676#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26676#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:54,628 INFO L290 TraceCheckUtils]: 73: Hoare triple {26676#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:54,629 INFO L272 TraceCheckUtils]: 74: Hoare triple {26676#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:54,629 INFO L290 TraceCheckUtils]: 75: Hoare triple {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:54,629 INFO L290 TraceCheckUtils]: 76: Hoare triple {26935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26670#false} is VALID [2022-04-15 12:17:54,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {26670#false} assume !false; {26670#false} is VALID [2022-04-15 12:17:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 12:17:54,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:54,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {26670#false} assume !false; {26670#false} is VALID [2022-04-15 12:17:54,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {26935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26670#false} is VALID [2022-04-15 12:17:54,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:54,878 INFO L272 TraceCheckUtils]: 74: Hoare triple {26951#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:54,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {26951#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {26951#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:54,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {26951#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26951#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:54,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {26961#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26951#(<= main_~i~0 1024)} is VALID [2022-04-15 12:17:54,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {26961#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {26961#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:54,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {26961#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26961#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:54,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {26971#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26961#(<= main_~i~0 1023)} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {26971#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {26971#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {26971#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26971#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {26669#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {26971#(<= main_~i~0 1022)} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {26669#true} assume !(~i~0 < 1023); {26669#true} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 12:17:54,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {26669#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26669#true} is VALID [2022-04-15 12:17:54,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {26669#true} call #t~ret5 := main(); {26669#true} is VALID [2022-04-15 12:17:54,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 12:17:54,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 12:17:54,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {26669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {26669#true} is VALID [2022-04-15 12:17:54,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {26669#true} call ULTIMATE.init(); {26669#true} is VALID [2022-04-15 12:17:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 12:17:54,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109773897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:54,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7, 7] total 39 [2022-04-15 12:17:54,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [906720366] [2022-04-15 12:17:54,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [906720366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:54,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:17:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193357157] [2022-04-15 12:17:54,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 12:17:54,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:54,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:54,939 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-15 12:17:54,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:17:54,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:17:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=846, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:17:54,940 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,008 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2022-04-15 12:17:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:17:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 12:17:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 234 transitions. [2022-04-15 12:17:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 234 transitions. [2022-04-15 12:17:58,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 234 transitions. [2022-04-15 12:17:58,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:58,192 INFO L225 Difference]: With dead ends: 209 [2022-04-15 12:17:58,192 INFO L226 Difference]: Without dead ends: 195 [2022-04-15 12:17:58,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1717, Invalid=2975, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:17:58,193 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 402 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:58,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 41 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-04-15 12:17:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 81. [2022-04-15 12:17:58,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:58,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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-15 12:17:58,486 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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-15 12:17:58,486 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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-15 12:17:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,488 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2022-04-15 12:17:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2022-04-15 12:17:58,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:58,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:58,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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 195 states. [2022-04-15 12:17:58,489 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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 195 states. [2022-04-15 12:17:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,492 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2022-04-15 12:17:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2022-04-15 12:17:58,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:58,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:58,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:58,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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-15 12:17:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-04-15 12:17:58,494 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2022-04-15 12:17:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:58,494 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-04-15 12:17:58,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 82 transitions. [2022-04-15 12:17:58,614 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-15 12:17:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 12:17:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 12:17:58,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:58,614 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:58,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 12:17:58,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:58,815 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1552771669, now seen corresponding path program 61 times [2022-04-15 12:17:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178014010] [2022-04-15 12:17:58,821 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:58,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1552771669, now seen corresponding path program 62 times [2022-04-15 12:17:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:58,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704694485] [2022-04-15 12:17:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:59,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {28244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {28208#true} is VALID [2022-04-15 12:17:59,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 12:17:59,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 12:17:59,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {28208#true} call ULTIMATE.init(); {28244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:59,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {28244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {28208#true} is VALID [2022-04-15 12:17:59,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 12:17:59,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 12:17:59,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {28208#true} call #t~ret5 := main(); {28208#true} is VALID [2022-04-15 12:17:59,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {28208#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28213#(= main_~i~0 0)} is VALID [2022-04-15 12:17:59,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {28213#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28213#(= main_~i~0 0)} is VALID [2022-04-15 12:17:59,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {28213#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:59,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {28214#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 12:17:59,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {28214#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:59,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {28215#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:59,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {28215#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:59,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {28216#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:59,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {28216#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:59,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {28217#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:59,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {28217#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:59,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {28218#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:59,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {28218#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:59,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {28219#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:59,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {28219#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:59,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {28220#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:59,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {28220#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:59,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {28221#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -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 8)} is VALID [2022-04-15 12:17:59,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {28221#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:59,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {28222#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:59,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {28222#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:59,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {28223#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:59,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {28223#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:59,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {28224#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:59,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {28224#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:59,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {28225#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:59,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {28225#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:59,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {28226#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:59,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {28226#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:59,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {28227#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:59,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {28227#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:59,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {28228#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -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 15)} is VALID [2022-04-15 12:17:59,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {28228#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:59,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {28229#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:59,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {28229#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:59,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {28230#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:59,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {28230#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:59,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {28231#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:59,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {28231#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:59,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {28232#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:59,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {28232#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:59,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {28233#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:59,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {28233#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:59,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {28234#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:59,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {28234#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:59,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {28235#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -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 22)} is VALID [2022-04-15 12:17:59,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {28235#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:59,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {28236#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:59,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {28236#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:59,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {28237#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:59,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {28237#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:59,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {28238#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:59,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {28238#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:59,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {28239#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:59,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {28239#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:59,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {28240#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:59,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {28240#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:59,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {28241#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:59,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {28241#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:59,562 INFO L290 TraceCheckUtils]: 64: Hoare triple {28242#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -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 29)} is VALID [2022-04-15 12:17:59,562 INFO L290 TraceCheckUtils]: 65: Hoare triple {28242#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28243#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 66: Hoare triple {28243#(<= main_~i~0 30)} assume !(~i~0 < 1023); {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 67: Hoare triple {28209#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 68: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 71: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 72: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 73: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 74: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:17:59,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {28209#false} assume !(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:17:59,564 INFO L272 TraceCheckUtils]: 76: Hoare triple {28209#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28209#false} is VALID [2022-04-15 12:17:59,564 INFO L290 TraceCheckUtils]: 77: Hoare triple {28209#false} ~cond := #in~cond; {28209#false} is VALID [2022-04-15 12:17:59,564 INFO L290 TraceCheckUtils]: 78: Hoare triple {28209#false} assume 0 == ~cond; {28209#false} is VALID [2022-04-15 12:17:59,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {28209#false} assume !false; {28209#false} is VALID [2022-04-15 12:17:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:17:59,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:59,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704694485] [2022-04-15 12:17:59,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704694485] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:59,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117129809] [2022-04-15 12:17:59,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:59,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:59,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:59,566 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:59,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 12:17:59,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:59,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:59,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:17:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:59,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:00,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {28208#true} call ULTIMATE.init(); {28208#true} is VALID [2022-04-15 12:18:00,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {28208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {28208#true} is VALID [2022-04-15 12:18:00,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 12:18:00,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 12:18:00,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {28208#true} call #t~ret5 := main(); {28208#true} is VALID [2022-04-15 12:18:00,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {28208#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28263#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:00,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {28263#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28263#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:00,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {28263#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:00,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {28214#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 12:18:00,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {28214#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:00,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {28215#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:00,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {28215#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:00,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {28216#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:00,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {28216#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:00,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {28217#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:00,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {28217#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:00,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {28218#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:00,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {28218#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:00,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {28219#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:00,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {28219#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:00,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {28220#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:00,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {28220#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:00,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {28221#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -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 8)} is VALID [2022-04-15 12:18:00,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {28221#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:00,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {28222#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:00,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {28222#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:00,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {28223#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:00,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {28223#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:00,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {28224#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:00,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {28224#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:00,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {28225#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:00,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {28225#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:00,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {28226#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:00,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {28226#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:00,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {28227#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:00,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {28227#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:00,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {28228#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -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 15)} is VALID [2022-04-15 12:18:00,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {28228#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:00,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {28229#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:00,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {28229#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:00,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {28230#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:00,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {28230#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:00,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {28231#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:00,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {28231#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:00,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {28232#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:00,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {28232#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:00,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {28233#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:00,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {28233#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:00,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {28234#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:00,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {28234#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:00,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {28235#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -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 22)} is VALID [2022-04-15 12:18:00,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {28235#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:00,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {28236#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:00,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {28236#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:00,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {28237#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:00,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {28237#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:00,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {28238#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:00,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {28238#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:00,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {28239#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:00,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {28239#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:00,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {28240#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:00,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {28240#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:00,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {28241#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:00,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {28241#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:00,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {28242#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -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 29)} is VALID [2022-04-15 12:18:00,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {28242#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28243#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {28243#(<= main_~i~0 30)} assume !(~i~0 < 1023); {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {28209#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 12:18:00,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:18:00,309 INFO L290 TraceCheckUtils]: 75: Hoare triple {28209#false} assume !(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:18:00,309 INFO L272 TraceCheckUtils]: 76: Hoare triple {28209#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28209#false} is VALID [2022-04-15 12:18:00,309 INFO L290 TraceCheckUtils]: 77: Hoare triple {28209#false} ~cond := #in~cond; {28209#false} is VALID [2022-04-15 12:18:00,309 INFO L290 TraceCheckUtils]: 78: Hoare triple {28209#false} assume 0 == ~cond; {28209#false} is VALID [2022-04-15 12:18:00,309 INFO L290 TraceCheckUtils]: 79: Hoare triple {28209#false} assume !false; {28209#false} is VALID [2022-04-15 12:18:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:00,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:01,650 INFO L290 TraceCheckUtils]: 79: Hoare triple {28209#false} assume !false; {28209#false} is VALID [2022-04-15 12:18:01,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {28209#false} assume 0 == ~cond; {28209#false} is VALID [2022-04-15 12:18:01,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {28209#false} ~cond := #in~cond; {28209#false} is VALID [2022-04-15 12:18:01,650 INFO L272 TraceCheckUtils]: 76: Hoare triple {28209#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28209#false} is VALID [2022-04-15 12:18:01,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {28209#false} assume !(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 73: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 69: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {28209#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28209#false} is VALID [2022-04-15 12:18:01,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {28525#(< main_~i~0 1023)} assume !(~i~0 < 1023); {28209#false} is VALID [2022-04-15 12:18:01,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {28529#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28525#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:01,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {28529#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28529#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:01,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {28536#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28529#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:01,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {28536#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28536#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:01,653 INFO L290 TraceCheckUtils]: 61: Hoare triple {28543#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28536#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:01,653 INFO L290 TraceCheckUtils]: 60: Hoare triple {28543#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28543#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:01,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {28550#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28543#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:01,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {28550#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28550#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:01,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {28557#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28550#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:01,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {28557#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28557#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:01,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {28564#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28557#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:01,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {28564#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28564#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:01,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {28571#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28564#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:01,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {28571#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28571#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:01,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {28578#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28571#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:01,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {28578#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28578#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:01,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {28585#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28578#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:01,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {28585#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28585#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:01,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {28592#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28585#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:01,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {28592#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28592#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:01,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {28599#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28592#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:01,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {28599#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28599#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:01,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {28606#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28599#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:01,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {28606#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28606#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:01,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {28613#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28606#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:01,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {28613#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28613#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:01,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {28620#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28613#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:01,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {28620#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28620#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:01,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {28627#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28620#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:01,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {28627#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28627#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:01,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {28634#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28627#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:01,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {28634#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28634#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:01,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {28641#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28634#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:01,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {28641#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28641#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:01,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {28648#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28641#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:01,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {28648#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28648#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:01,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {28655#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28648#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:01,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {28655#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28655#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:01,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {28662#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28655#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:01,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {28662#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28662#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:01,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {28669#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28662#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:01,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {28669#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28669#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:01,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {28676#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28669#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:01,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {28676#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28676#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:01,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {28683#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28676#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:01,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {28683#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28683#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:01,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {28690#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28683#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:01,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {28690#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28690#(< main_~i~0 999)} is VALID [2022-04-15 12:18:01,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {28697#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28690#(< main_~i~0 999)} is VALID [2022-04-15 12:18:01,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {28697#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28697#(< main_~i~0 998)} is VALID [2022-04-15 12:18:01,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {28704#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28697#(< main_~i~0 998)} is VALID [2022-04-15 12:18:01,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {28704#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28704#(< main_~i~0 997)} is VALID [2022-04-15 12:18:01,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {28711#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28704#(< main_~i~0 997)} is VALID [2022-04-15 12:18:01,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {28711#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28711#(< main_~i~0 996)} is VALID [2022-04-15 12:18:01,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {28718#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28711#(< main_~i~0 996)} is VALID [2022-04-15 12:18:01,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {28718#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28718#(< main_~i~0 995)} is VALID [2022-04-15 12:18:01,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {28725#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28718#(< main_~i~0 995)} is VALID [2022-04-15 12:18:01,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {28725#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28725#(< main_~i~0 994)} is VALID [2022-04-15 12:18:01,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {28732#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28725#(< main_~i~0 994)} is VALID [2022-04-15 12:18:01,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {28732#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28732#(< main_~i~0 993)} is VALID [2022-04-15 12:18:01,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {28208#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28732#(< main_~i~0 993)} is VALID [2022-04-15 12:18:01,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {28208#true} call #t~ret5 := main(); {28208#true} is VALID [2022-04-15 12:18:01,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 12:18:01,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 12:18:01,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {28208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {28208#true} is VALID [2022-04-15 12:18:01,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {28208#true} call ULTIMATE.init(); {28208#true} is VALID [2022-04-15 12:18:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:01,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117129809] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:01,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:01,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-15 12:18:01,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:01,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178014010] [2022-04-15 12:18:01,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178014010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:01,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:01,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:18:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796170149] [2022-04-15 12:18:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 12:18:01,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:01,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:01,725 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-15 12:18:01,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:18:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:18:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:18:01,727 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:04,862 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2022-04-15 12:18:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:18:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 12:18:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 241 transitions. [2022-04-15 12:18:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 241 transitions. [2022-04-15 12:18:04,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 241 transitions. [2022-04-15 12:18:05,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:05,053 INFO L225 Difference]: With dead ends: 215 [2022-04-15 12:18:05,053 INFO L226 Difference]: Without dead ends: 201 [2022-04-15 12:18:05,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 12:18:05,054 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 429 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:05,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 51 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-15 12:18:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 83. [2022-04-15 12:18:05,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:05,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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-15 12:18:05,357 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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-15 12:18:05,357 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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-15 12:18:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:05,360 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-04-15 12:18:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-04-15 12:18:05,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:05,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:05,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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 201 states. [2022-04-15 12:18:05,361 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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 201 states. [2022-04-15 12:18:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:05,364 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-04-15 12:18:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-04-15 12:18:05,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:05,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:05,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:05,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 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-15 12:18:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-04-15 12:18:05,366 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2022-04-15 12:18:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:05,366 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-04-15 12:18:05,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:05,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 84 transitions. [2022-04-15 12:18:05,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 12:18:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 12:18:05,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:05,525 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:05,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 12:18:05,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:05,739 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 672699853, now seen corresponding path program 63 times [2022-04-15 12:18:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601688125] [2022-04-15 12:18:05,745 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:05,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 672699853, now seen corresponding path program 64 times [2022-04-15 12:18:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:05,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856476279] [2022-04-15 12:18:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {29853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {29816#true} is VALID [2022-04-15 12:18:06,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 12:18:06,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 12:18:06,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {29816#true} call ULTIMATE.init(); {29853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:06,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {29853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {29816#true} is VALID [2022-04-15 12:18:06,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 12:18:06,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 12:18:06,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {29816#true} call #t~ret5 := main(); {29816#true} is VALID [2022-04-15 12:18:06,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {29816#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29821#(= main_~i~0 0)} is VALID [2022-04-15 12:18:06,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {29821#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29821#(= main_~i~0 0)} is VALID [2022-04-15 12:18:06,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {29821#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:06,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {29822#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:06,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {29822#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:06,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {29823#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:06,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {29823#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:06,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {29824#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:06,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {29824#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:06,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {29825#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:06,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {29825#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:06,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {29826#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:06,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {29826#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:06,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {29827#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:06,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {29827#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:06,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {29828#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:06,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {29828#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:06,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {29829#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:06,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:06,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {29830#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:06,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {29830#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:06,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {29831#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:06,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {29831#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:06,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {29832#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:06,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {29832#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:06,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {29833#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:06,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {29833#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:06,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {29834#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:06,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {29834#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:06,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {29835#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:06,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {29835#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:06,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {29836#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:06,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {29836#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:06,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {29837#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:06,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {29837#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:06,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:06,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:06,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {29839#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:06,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {29839#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:06,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {29840#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:06,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {29840#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:06,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {29841#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:06,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {29841#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:06,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {29842#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:06,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {29842#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:06,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {29843#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:06,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {29843#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:06,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {29844#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:06,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {29844#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:06,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {29845#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:06,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {29845#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:06,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {29846#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:06,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {29846#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:06,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {29847#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:06,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {29847#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:06,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {29848#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:06,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {29848#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:06,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {29849#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:06,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {29849#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:06,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {29850#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:06,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {29850#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:06,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {29851#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:06,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {29851#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29852#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:06,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {29852#(<= main_~i~0 31)} assume !(~i~0 < 1023); {29817#false} is VALID [2022-04-15 12:18:06,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {29817#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {29817#false} is VALID [2022-04-15 12:18:06,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:06,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:06,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {29817#false} assume !(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L272 TraceCheckUtils]: 78: Hoare triple {29817#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 79: Hoare triple {29817#false} ~cond := #in~cond; {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 80: Hoare triple {29817#false} assume 0 == ~cond; {29817#false} is VALID [2022-04-15 12:18:06,316 INFO L290 TraceCheckUtils]: 81: Hoare triple {29817#false} assume !false; {29817#false} is VALID [2022-04-15 12:18:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856476279] [2022-04-15 12:18:06,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856476279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615539326] [2022-04-15 12:18:06,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:06,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:06,318 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:06,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 12:18:06,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:06,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:06,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:18:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:06,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {29816#true} call ULTIMATE.init(); {29816#true} is VALID [2022-04-15 12:18:06,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {29816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {29816#true} is VALID [2022-04-15 12:18:06,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 12:18:06,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 12:18:06,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {29816#true} call #t~ret5 := main(); {29816#true} is VALID [2022-04-15 12:18:06,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {29816#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29872#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:06,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {29872#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29872#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:06,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {29872#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:06,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {29822#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:06,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {29822#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:06,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {29823#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:06,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {29823#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:06,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {29824#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:06,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {29824#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:06,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {29825#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:06,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {29825#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:06,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {29826#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:06,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {29826#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:06,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {29827#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:06,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {29827#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:06,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {29828#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:06,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {29828#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:06,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {29829#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:06,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:06,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {29830#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:06,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {29830#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:06,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {29831#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:06,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {29831#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:06,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {29832#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:06,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {29832#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:06,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {29833#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:06,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {29833#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:06,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {29834#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:06,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {29834#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:06,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {29835#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:06,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {29835#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:06,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {29836#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:06,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {29836#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:06,991 INFO L290 TraceCheckUtils]: 38: Hoare triple {29837#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:06,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {29837#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:06,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:06,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:06,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {29839#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:06,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {29839#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:06,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {29840#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:06,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {29840#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:06,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {29841#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:06,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {29841#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:06,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {29842#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:06,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {29842#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:06,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {29843#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:06,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {29843#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:06,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {29844#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:06,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {29844#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:06,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {29845#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:06,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {29845#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:06,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {29846#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:06,998 INFO L290 TraceCheckUtils]: 57: Hoare triple {29846#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:06,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {29847#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:06,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {29847#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:06,999 INFO L290 TraceCheckUtils]: 60: Hoare triple {29848#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:06,999 INFO L290 TraceCheckUtils]: 61: Hoare triple {29848#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:06,999 INFO L290 TraceCheckUtils]: 62: Hoare triple {29849#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:07,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {29849#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:07,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {29850#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:07,001 INFO L290 TraceCheckUtils]: 65: Hoare triple {29850#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:07,001 INFO L290 TraceCheckUtils]: 66: Hoare triple {29851#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:07,001 INFO L290 TraceCheckUtils]: 67: Hoare triple {29851#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29852#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 68: Hoare triple {29852#(<= main_~i~0 31)} assume !(~i~0 < 1023); {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 69: Hoare triple {29817#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 70: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 71: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 72: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 73: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 74: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {29817#false} assume !(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L272 TraceCheckUtils]: 78: Hoare triple {29817#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {29817#false} ~cond := #in~cond; {29817#false} is VALID [2022-04-15 12:18:07,002 INFO L290 TraceCheckUtils]: 80: Hoare triple {29817#false} assume 0 == ~cond; {29817#false} is VALID [2022-04-15 12:18:07,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {29817#false} assume !false; {29817#false} is VALID [2022-04-15 12:18:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:07,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:08,460 INFO L290 TraceCheckUtils]: 81: Hoare triple {29817#false} assume !false; {29817#false} is VALID [2022-04-15 12:18:08,460 INFO L290 TraceCheckUtils]: 80: Hoare triple {29817#false} assume 0 == ~cond; {29817#false} is VALID [2022-04-15 12:18:08,460 INFO L290 TraceCheckUtils]: 79: Hoare triple {29817#false} ~cond := #in~cond; {29817#false} is VALID [2022-04-15 12:18:08,460 INFO L272 TraceCheckUtils]: 78: Hoare triple {29817#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {29817#false} assume !(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 71: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {29817#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {29817#false} is VALID [2022-04-15 12:18:08,461 INFO L290 TraceCheckUtils]: 68: Hoare triple {30140#(< main_~i~0 1023)} assume !(~i~0 < 1023); {29817#false} is VALID [2022-04-15 12:18:08,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {30144#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30140#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:08,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {30144#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30144#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:08,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {30151#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30144#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:08,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {30151#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30151#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:08,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {30158#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30151#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:08,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {30158#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30158#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:08,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {30165#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30158#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:08,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {30165#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30165#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:08,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {30172#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30165#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:08,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {30172#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30172#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:08,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {30179#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30172#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:08,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {30179#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30179#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:08,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {30186#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30179#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:08,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {30186#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30186#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:08,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {30193#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30186#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:08,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {30193#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30193#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:08,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {30200#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30193#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:08,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {30200#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30200#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:08,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {30207#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30200#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:08,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {30207#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30207#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:08,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {30214#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30207#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:08,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {30214#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30214#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:08,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {30221#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30214#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:08,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {30221#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30221#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:08,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {30228#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30221#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:08,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {30228#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30228#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:08,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {30235#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30228#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:08,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {30235#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30235#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:08,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {30242#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30235#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:08,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {30242#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30242#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:08,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {30249#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30242#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:08,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {30249#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30249#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:08,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {30256#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30249#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:08,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {30256#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30256#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:08,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {30263#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30256#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:08,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {30263#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30263#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:08,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {30270#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:08,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {30270#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30270#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:08,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {30277#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30270#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:08,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {30277#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30277#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:08,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {30284#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30277#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:08,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {30284#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30284#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:08,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {30291#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30284#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:08,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {30291#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30291#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:08,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {30298#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30291#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:08,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {30298#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30298#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:08,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {30305#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30298#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:08,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {30305#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30305#(< main_~i~0 999)} is VALID [2022-04-15 12:18:08,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {30312#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30305#(< main_~i~0 999)} is VALID [2022-04-15 12:18:08,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {30312#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30312#(< main_~i~0 998)} is VALID [2022-04-15 12:18:08,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {30319#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30312#(< main_~i~0 998)} is VALID [2022-04-15 12:18:08,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {30319#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30319#(< main_~i~0 997)} is VALID [2022-04-15 12:18:08,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {30326#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30319#(< main_~i~0 997)} is VALID [2022-04-15 12:18:08,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {30326#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30326#(< main_~i~0 996)} is VALID [2022-04-15 12:18:08,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {30333#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30326#(< main_~i~0 996)} is VALID [2022-04-15 12:18:08,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {30333#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30333#(< main_~i~0 995)} is VALID [2022-04-15 12:18:08,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {30340#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30333#(< main_~i~0 995)} is VALID [2022-04-15 12:18:08,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {30340#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30340#(< main_~i~0 994)} is VALID [2022-04-15 12:18:08,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {30347#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30340#(< main_~i~0 994)} is VALID [2022-04-15 12:18:08,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {30347#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30347#(< main_~i~0 993)} is VALID [2022-04-15 12:18:08,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {30354#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30347#(< main_~i~0 993)} is VALID [2022-04-15 12:18:08,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {30354#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30354#(< main_~i~0 992)} is VALID [2022-04-15 12:18:08,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {29816#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {30354#(< main_~i~0 992)} is VALID [2022-04-15 12:18:08,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {29816#true} call #t~ret5 := main(); {29816#true} is VALID [2022-04-15 12:18:08,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 12:18:08,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 12:18:08,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {29816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {29816#true} is VALID [2022-04-15 12:18:08,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {29816#true} call ULTIMATE.init(); {29816#true} is VALID [2022-04-15 12:18:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:08,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615539326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:08,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 12:18:08,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:08,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601688125] [2022-04-15 12:18:08,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601688125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:08,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:08,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:18:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793109305] [2022-04-15 12:18:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 12:18:08,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:08,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:08,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:08,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:18:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:18:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 12:18:08,537 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:11,991 INFO L93 Difference]: Finished difference Result 221 states and 253 transitions. [2022-04-15 12:18:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:18:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 12:18:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 248 transitions. [2022-04-15 12:18:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 248 transitions. [2022-04-15 12:18:11,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 248 transitions. [2022-04-15 12:18:12,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:12,179 INFO L225 Difference]: With dead ends: 221 [2022-04-15 12:18:12,179 INFO L226 Difference]: Without dead ends: 207 [2022-04-15 12:18:12,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 12:18:12,180 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 409 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:12,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 36 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-15 12:18:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 85. [2022-04-15 12:18:12,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:12,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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-15 12:18:12,508 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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-15 12:18:12,508 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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-15 12:18:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,513 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2022-04-15 12:18:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2022-04-15 12:18:12,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:12,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:12,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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 207 states. [2022-04-15 12:18:12,514 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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 207 states. [2022-04-15 12:18:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,517 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2022-04-15 12:18:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2022-04-15 12:18:12,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:12,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:12,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:12,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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-15 12:18:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-15 12:18:12,519 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2022-04-15 12:18:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:12,519 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-15 12:18:12,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:12,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-15 12:18:12,650 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-15 12:18:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 12:18:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 12:18:12,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:12,650 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:12,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 12:18:12,851 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 457119087, now seen corresponding path program 65 times [2022-04-15 12:18:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:12,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735683562] [2022-04-15 12:18:12,856 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:12,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 457119087, now seen corresponding path program 66 times [2022-04-15 12:18:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:12,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948290201] [2022-04-15 12:18:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:13,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {31506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {31468#true} is VALID [2022-04-15 12:18:13,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 12:18:13,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 12:18:13,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {31468#true} call ULTIMATE.init(); {31506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:13,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {31506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {31468#true} is VALID [2022-04-15 12:18:13,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 12:18:13,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 12:18:13,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {31468#true} call #t~ret5 := main(); {31468#true} is VALID [2022-04-15 12:18:13,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {31468#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31473#(= main_~i~0 0)} is VALID [2022-04-15 12:18:13,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {31473#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31473#(= main_~i~0 0)} is VALID [2022-04-15 12:18:13,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {31473#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:13,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {31474#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:13,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {31474#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:13,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {31475#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:13,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {31475#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31476#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:13,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {31476#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31476#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:13,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {31476#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31477#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:13,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {31477#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31477#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:13,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {31477#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31478#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:13,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {31478#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31478#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:13,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {31478#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31479#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:13,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {31479#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 12:18:13,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {31479#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31480#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:13,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {31480#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31480#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:13,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {31480#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31481#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:13,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {31481#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31481#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:13,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {31481#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31482#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:13,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {31482#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31482#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:13,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {31482#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31483#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:13,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {31483#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31483#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:13,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {31483#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31484#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:13,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {31484#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31484#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:13,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {31484#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31485#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:13,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {31485#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31485#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:13,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {31485#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31486#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:13,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {31486#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -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 13)} is VALID [2022-04-15 12:18:13,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {31486#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31487#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:13,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {31487#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31487#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:13,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {31487#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31488#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:13,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {31488#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31488#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:13,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {31488#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31489#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:13,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {31489#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31489#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:13,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {31489#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31490#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:13,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {31490#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31490#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:13,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {31490#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31491#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:13,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {31491#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31491#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:13,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {31491#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31492#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:13,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {31492#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31492#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:13,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {31492#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31493#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:13,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {31493#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -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 20)} is VALID [2022-04-15 12:18:13,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {31493#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31494#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:13,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {31494#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31494#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:13,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {31494#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31495#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:13,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {31495#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31495#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:13,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {31495#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31496#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:13,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {31496#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31496#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:13,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {31496#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31497#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:13,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {31497#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31497#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:13,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {31497#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31498#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:13,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {31498#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31498#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:13,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {31498#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31499#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:13,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {31499#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31499#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:13,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {31499#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31500#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:13,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {31500#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -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 27)} is VALID [2022-04-15 12:18:13,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {31500#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31501#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:13,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {31501#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31501#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:13,405 INFO L290 TraceCheckUtils]: 63: Hoare triple {31501#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31502#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:13,405 INFO L290 TraceCheckUtils]: 64: Hoare triple {31502#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31502#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:13,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {31502#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31503#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:13,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {31503#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31503#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:13,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {31503#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31504#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:13,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {31504#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31504#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:13,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {31504#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31505#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:13,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {31505#(<= main_~i~0 32)} assume !(~i~0 < 1023); {31469#false} is VALID [2022-04-15 12:18:13,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {31469#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {31469#false} is VALID [2022-04-15 12:18:13,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {31469#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31469#false} is VALID [2022-04-15 12:18:13,407 INFO L290 TraceCheckUtils]: 73: Hoare triple {31469#false} assume !!(0 != #t~mem4);havoc #t~mem4; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {31469#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {31469#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 76: Hoare triple {31469#false} assume !!(0 != #t~mem4);havoc #t~mem4; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {31469#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {31469#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 79: Hoare triple {31469#false} assume !(0 != #t~mem4);havoc #t~mem4; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L272 TraceCheckUtils]: 80: Hoare triple {31469#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 81: Hoare triple {31469#false} ~cond := #in~cond; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {31469#false} assume 0 == ~cond; {31469#false} is VALID [2022-04-15 12:18:13,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {31469#false} assume !false; {31469#false} is VALID [2022-04-15 12:18:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948290201] [2022-04-15 12:18:13,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948290201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558185001] [2022-04-15 12:18:13,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:13,410 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:13,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 12:18:13,570 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:18:13,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:13,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:13,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:13,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {31468#true} call ULTIMATE.init(); {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {31468#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {31468#true} call #t~ret5 := main(); {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {31468#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 58: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:13,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {31468#true} assume !(~i~0 < 1023); {31468#true} is VALID [2022-04-15 12:18:13,808 INFO L290 TraceCheckUtils]: 71: Hoare triple {31468#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {31723#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:13,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {31723#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31723#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:13,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {31723#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {31723#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:13,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {31723#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:13,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {31474#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31474#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:13,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {31474#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:13,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {31474#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:13,811 INFO L290 TraceCheckUtils]: 78: Hoare triple {31475#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31475#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:13,811 INFO L290 TraceCheckUtils]: 79: Hoare triple {31475#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:13,811 INFO L272 TraceCheckUtils]: 80: Hoare triple {31475#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:13,812 INFO L290 TraceCheckUtils]: 81: Hoare triple {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:13,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {31755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31469#false} is VALID [2022-04-15 12:18:13,812 INFO L290 TraceCheckUtils]: 83: Hoare triple {31469#false} assume !false; {31469#false} is VALID [2022-04-15 12:18:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 12:18:13,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:14,061 INFO L290 TraceCheckUtils]: 83: Hoare triple {31469#false} assume !false; {31469#false} is VALID [2022-04-15 12:18:14,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {31755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31469#false} is VALID [2022-04-15 12:18:14,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:14,063 INFO L272 TraceCheckUtils]: 80: Hoare triple {31771#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:14,063 INFO L290 TraceCheckUtils]: 79: Hoare triple {31771#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {31771#(<= main_~i~0 1024)} is VALID [2022-04-15 12:18:14,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {31771#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31771#(<= main_~i~0 1024)} is VALID [2022-04-15 12:18:14,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {31781#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31771#(<= main_~i~0 1024)} is VALID [2022-04-15 12:18:14,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {31781#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {31781#(<= main_~i~0 1023)} is VALID [2022-04-15 12:18:14,065 INFO L290 TraceCheckUtils]: 75: Hoare triple {31781#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31781#(<= main_~i~0 1023)} is VALID [2022-04-15 12:18:14,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {31791#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31781#(<= main_~i~0 1023)} is VALID [2022-04-15 12:18:14,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {31791#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {31791#(<= main_~i~0 1022)} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {31791#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31791#(<= main_~i~0 1022)} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {31468#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {31791#(<= main_~i~0 1022)} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {31468#true} assume !(~i~0 < 1023); {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {31468#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31468#true} is VALID [2022-04-15 12:18:14,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {31468#true} call #t~ret5 := main(); {31468#true} is VALID [2022-04-15 12:18:14,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 12:18:14,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 12:18:14,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {31468#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {31468#true} is VALID [2022-04-15 12:18:14,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {31468#true} call ULTIMATE.init(); {31468#true} is VALID [2022-04-15 12:18:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 12:18:14,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558185001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:14,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 7, 7] total 42 [2022-04-15 12:18:14,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:14,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735683562] [2022-04-15 12:18:14,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735683562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:14,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:14,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:18:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997124189] [2022-04-15 12:18:14,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 12:18:14,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:14,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:14,129 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-15 12:18:14,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:18:14,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:14,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:18:14,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=747, Invalid=975, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:18:14,130 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:17,931 INFO L93 Difference]: Finished difference Result 227 states and 260 transitions. [2022-04-15 12:18:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:18:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 12:18:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 255 transitions. [2022-04-15 12:18:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 255 transitions. [2022-04-15 12:18:17,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 255 transitions. [2022-04-15 12:18:18,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:18,124 INFO L225 Difference]: With dead ends: 227 [2022-04-15 12:18:18,124 INFO L226 Difference]: Without dead ends: 213 [2022-04-15 12:18:18,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2035, Invalid=3515, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:18:18,125 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 554 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:18,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 31 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-15 12:18:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 87. [2022-04-15 12:18:18,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:18,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,457 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,457 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,460 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2022-04-15 12:18:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2022-04-15 12:18:18,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 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 213 states. [2022-04-15 12:18:18,460 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 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 213 states. [2022-04-15 12:18:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,463 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2022-04-15 12:18:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2022-04-15 12:18:18,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:18,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-15 12:18:18,465 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2022-04-15 12:18:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:18,465 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-15 12:18:18,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-15 12:18:18,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-15 12:18:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 12:18:18,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:18,596 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:18,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:18,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 12:18:18,797 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash -557566831, now seen corresponding path program 67 times [2022-04-15 12:18:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:18,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113431214] [2022-04-15 12:18:18,802 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:18,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash -557566831, now seen corresponding path program 68 times [2022-04-15 12:18:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:18,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826184957] [2022-04-15 12:18:18,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {33175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33136#true} is VALID [2022-04-15 12:18:19,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 12:18:19,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 12:18:19,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {33136#true} call ULTIMATE.init(); {33175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:19,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {33175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33136#true} is VALID [2022-04-15 12:18:19,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 12:18:19,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 12:18:19,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {33136#true} call #t~ret5 := main(); {33136#true} is VALID [2022-04-15 12:18:19,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {33136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33141#(= main_~i~0 0)} is VALID [2022-04-15 12:18:19,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {33141#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33141#(= main_~i~0 0)} is VALID [2022-04-15 12:18:19,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {33141#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:19,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {33142#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:19,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {33142#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:19,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {33143#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:19,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {33143#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:19,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {33144#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:19,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {33144#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:19,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {33145#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:19,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {33145#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:19,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {33146#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:19,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {33146#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:19,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {33147#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:19,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {33147#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:19,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {33148#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:19,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {33148#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:19,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {33149#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:19,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {33149#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:19,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {33150#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:19,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {33150#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:19,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {33151#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:19,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {33151#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:19,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {33152#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:19,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {33152#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:19,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {33153#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:19,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {33153#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:19,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {33154#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:19,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {33154#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:19,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {33155#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:19,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {33155#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:19,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {33156#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:19,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {33156#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:19,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {33157#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:19,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {33157#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:19,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {33158#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:19,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {33158#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:19,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {33159#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:19,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {33159#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:19,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {33160#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:19,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {33160#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:19,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {33161#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:19,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {33161#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:19,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {33162#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:19,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {33162#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:19,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {33163#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:19,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {33163#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:19,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {33164#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:19,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {33164#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:19,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {33165#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:19,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {33165#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:19,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {33166#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:19,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {33166#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:19,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {33167#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:19,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {33167#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:19,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {33168#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:19,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {33168#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:19,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {33169#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:19,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {33169#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:19,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {33170#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:19,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {33170#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:19,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {33171#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:19,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {33171#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:19,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {33172#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:19,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {33172#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:19,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {33173#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:19,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {33173#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33174#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {33174#(<= main_~i~0 33)} assume !(~i~0 < 1023); {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {33137#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 75: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 78: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:19,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 12:18:19,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:19,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {33137#false} assume !(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:19,374 INFO L272 TraceCheckUtils]: 82: Hoare triple {33137#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {33137#false} is VALID [2022-04-15 12:18:19,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {33137#false} ~cond := #in~cond; {33137#false} is VALID [2022-04-15 12:18:19,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {33137#false} assume 0 == ~cond; {33137#false} is VALID [2022-04-15 12:18:19,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {33137#false} assume !false; {33137#false} is VALID [2022-04-15 12:18:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826184957] [2022-04-15 12:18:19,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826184957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835654696] [2022-04-15 12:18:19,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:19,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:19,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:19,380 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:19,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 12:18:19,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:19,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:19,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:18:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:20,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {33136#true} call ULTIMATE.init(); {33136#true} is VALID [2022-04-15 12:18:20,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {33136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33136#true} is VALID [2022-04-15 12:18:20,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 12:18:20,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 12:18:20,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {33136#true} call #t~ret5 := main(); {33136#true} is VALID [2022-04-15 12:18:20,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {33136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33194#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:20,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {33194#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33194#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:20,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {33194#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:20,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {33142#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:20,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {33142#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:20,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {33143#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:20,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {33143#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:20,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {33144#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:20,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {33144#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:20,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {33145#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:20,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {33145#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:20,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {33146#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:20,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {33146#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:20,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {33147#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:20,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {33147#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:20,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {33148#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:20,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {33148#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:20,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {33149#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:20,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {33149#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:20,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {33150#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:20,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {33150#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:20,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {33151#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:20,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {33151#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:20,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {33152#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:20,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {33152#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:20,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {33153#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:20,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {33153#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:20,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {33154#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:20,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {33154#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:20,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {33155#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:20,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {33155#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:20,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {33156#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:20,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {33156#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:20,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {33157#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:20,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {33157#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:20,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {33158#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:20,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {33158#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:20,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {33159#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:20,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {33159#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:20,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {33160#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:20,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {33160#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:20,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {33161#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:20,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {33161#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:20,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {33162#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:20,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {33162#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:20,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {33163#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:20,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {33163#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:20,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {33164#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:20,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {33164#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:20,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {33165#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:20,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {33165#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:20,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {33166#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:20,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {33166#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:20,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {33167#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:20,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {33167#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:20,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {33168#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:20,099 INFO L290 TraceCheckUtils]: 61: Hoare triple {33168#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:20,099 INFO L290 TraceCheckUtils]: 62: Hoare triple {33169#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:20,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {33169#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:20,100 INFO L290 TraceCheckUtils]: 64: Hoare triple {33170#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:20,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {33170#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:20,100 INFO L290 TraceCheckUtils]: 66: Hoare triple {33171#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:20,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {33171#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:20,101 INFO L290 TraceCheckUtils]: 68: Hoare triple {33172#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:20,101 INFO L290 TraceCheckUtils]: 69: Hoare triple {33172#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:20,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {33173#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:20,102 INFO L290 TraceCheckUtils]: 71: Hoare triple {33173#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33174#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:20,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {33174#(<= main_~i~0 33)} assume !(~i~0 < 1023); {33137#false} is VALID [2022-04-15 12:18:20,102 INFO L290 TraceCheckUtils]: 73: Hoare triple {33137#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {33137#false} is VALID [2022-04-15 12:18:20,102 INFO L290 TraceCheckUtils]: 74: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:20,102 INFO L290 TraceCheckUtils]: 75: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 78: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {33137#false} assume !(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L272 TraceCheckUtils]: 82: Hoare triple {33137#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {33137#false} ~cond := #in~cond; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 84: Hoare triple {33137#false} assume 0 == ~cond; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {33137#false} assume !false; {33137#false} is VALID [2022-04-15 12:18:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:20,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:21,720 INFO L290 TraceCheckUtils]: 85: Hoare triple {33137#false} assume !false; {33137#false} is VALID [2022-04-15 12:18:21,720 INFO L290 TraceCheckUtils]: 84: Hoare triple {33137#false} assume 0 == ~cond; {33137#false} is VALID [2022-04-15 12:18:21,720 INFO L290 TraceCheckUtils]: 83: Hoare triple {33137#false} ~cond := #in~cond; {33137#false} is VALID [2022-04-15 12:18:21,720 INFO L272 TraceCheckUtils]: 82: Hoare triple {33137#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {33137#false} assume !(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 79: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 78: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {33137#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {33137#false} is VALID [2022-04-15 12:18:21,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {33474#(< main_~i~0 1023)} assume !(~i~0 < 1023); {33137#false} is VALID [2022-04-15 12:18:21,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {33478#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33474#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:21,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {33478#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33478#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:21,723 INFO L290 TraceCheckUtils]: 69: Hoare triple {33485#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33478#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:21,723 INFO L290 TraceCheckUtils]: 68: Hoare triple {33485#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33485#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:21,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {33492#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33485#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:21,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {33492#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33492#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:21,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {33499#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33492#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:21,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {33499#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33499#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:21,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {33506#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33499#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:21,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {33506#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33506#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:21,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {33513#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33506#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:21,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {33513#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33513#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:21,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {33520#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33513#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:21,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {33520#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33520#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:21,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {33527#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33520#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:21,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {33527#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33527#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:21,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {33534#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33527#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:21,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {33534#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33534#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:21,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {33541#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33534#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:21,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {33541#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33541#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:21,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {33548#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33541#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:21,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {33548#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33548#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:21,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {33555#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33548#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:21,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {33555#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33555#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:21,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {33562#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33555#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:21,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {33562#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33562#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:21,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {33569#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33562#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:21,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {33569#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33569#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:21,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {33576#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33569#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:21,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {33576#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33576#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:21,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {33583#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33576#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:21,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {33583#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33583#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:21,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {33590#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33583#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:21,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {33590#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33590#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:21,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {33597#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33590#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:21,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {33597#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33597#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:21,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {33604#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33597#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:21,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {33604#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33604#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:21,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {33611#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33604#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:21,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {33611#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33611#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:21,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {33618#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33611#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:21,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {33618#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33618#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:21,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {33625#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33618#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:21,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {33625#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33625#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:21,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {33632#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33625#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:21,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {33632#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33632#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:21,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {33639#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33632#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:21,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {33639#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33639#(< main_~i~0 999)} is VALID [2022-04-15 12:18:21,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {33646#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33639#(< main_~i~0 999)} is VALID [2022-04-15 12:18:21,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {33646#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33646#(< main_~i~0 998)} is VALID [2022-04-15 12:18:21,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {33653#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33646#(< main_~i~0 998)} is VALID [2022-04-15 12:18:21,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {33653#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33653#(< main_~i~0 997)} is VALID [2022-04-15 12:18:21,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {33660#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33653#(< main_~i~0 997)} is VALID [2022-04-15 12:18:21,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {33660#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33660#(< main_~i~0 996)} is VALID [2022-04-15 12:18:21,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {33667#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33660#(< main_~i~0 996)} is VALID [2022-04-15 12:18:21,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {33667#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33667#(< main_~i~0 995)} is VALID [2022-04-15 12:18:21,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {33674#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33667#(< main_~i~0 995)} is VALID [2022-04-15 12:18:21,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {33674#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33674#(< main_~i~0 994)} is VALID [2022-04-15 12:18:21,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {33681#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33674#(< main_~i~0 994)} is VALID [2022-04-15 12:18:21,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {33681#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33681#(< main_~i~0 993)} is VALID [2022-04-15 12:18:21,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {33688#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33681#(< main_~i~0 993)} is VALID [2022-04-15 12:18:21,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {33688#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33688#(< main_~i~0 992)} is VALID [2022-04-15 12:18:21,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {33695#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33688#(< main_~i~0 992)} is VALID [2022-04-15 12:18:21,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {33695#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33695#(< main_~i~0 991)} is VALID [2022-04-15 12:18:21,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {33702#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33695#(< main_~i~0 991)} is VALID [2022-04-15 12:18:21,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {33702#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33702#(< main_~i~0 990)} is VALID [2022-04-15 12:18:21,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {33136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33702#(< main_~i~0 990)} is VALID [2022-04-15 12:18:21,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {33136#true} call #t~ret5 := main(); {33136#true} is VALID [2022-04-15 12:18:21,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 12:18:21,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 12:18:21,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {33136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33136#true} is VALID [2022-04-15 12:18:21,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {33136#true} call ULTIMATE.init(); {33136#true} is VALID [2022-04-15 12:18:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835654696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:21,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 12:18:21,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:21,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113431214] [2022-04-15 12:18:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113431214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:18:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366485352] [2022-04-15 12:18:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:21,746 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 12:18:21,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:21,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,799 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-15 12:18:21,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:18:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:21,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:18:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 12:18:21,801 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:25,626 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2022-04-15 12:18:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:18:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 12:18:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 262 transitions. [2022-04-15 12:18:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 262 transitions. [2022-04-15 12:18:25,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 262 transitions. [2022-04-15 12:18:25,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:25,818 INFO L225 Difference]: With dead ends: 233 [2022-04-15 12:18:25,819 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 12:18:25,819 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 12:18:25,820 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 487 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:25,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 41 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 12:18:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 89. [2022-04-15 12:18:26,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:26,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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-15 12:18:26,179 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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-15 12:18:26,179 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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-15 12:18:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:26,181 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2022-04-15 12:18:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2022-04-15 12:18:26,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:26,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:26,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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 219 states. [2022-04-15 12:18:26,182 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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 219 states. [2022-04-15 12:18:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:26,184 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2022-04-15 12:18:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2022-04-15 12:18:26,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:26,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:26,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:26,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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-15 12:18:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-15 12:18:26,185 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2022-04-15 12:18:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:26,185 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-15 12:18:26,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:26,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-15 12:18:26,317 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-15 12:18:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:18:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 12:18:26,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:26,318 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:26,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:26,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 12:18:26,518 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash -713157837, now seen corresponding path program 69 times [2022-04-15 12:18:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:26,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552826607] [2022-04-15 12:18:26,523 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:26,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash -713157837, now seen corresponding path program 70 times [2022-04-15 12:18:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:26,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097243673] [2022-04-15 12:18:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:27,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {34916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {34876#true} is VALID [2022-04-15 12:18:27,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 12:18:27,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 12:18:27,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {34876#true} call ULTIMATE.init(); {34916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:27,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {34916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {34876#true} is VALID [2022-04-15 12:18:27,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 12:18:27,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 12:18:27,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {34876#true} call #t~ret5 := main(); {34876#true} is VALID [2022-04-15 12:18:27,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {34876#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34881#(= main_~i~0 0)} is VALID [2022-04-15 12:18:27,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {34881#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34881#(= main_~i~0 0)} is VALID [2022-04-15 12:18:27,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {34881#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:27,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {34882#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:27,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {34882#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:27,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {34883#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:27,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {34883#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:27,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {34884#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:27,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {34884#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:27,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {34885#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:27,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {34885#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:27,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {34886#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:27,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {34886#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:27,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {34887#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:27,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {34887#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:27,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {34888#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:27,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {34888#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:27,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {34889#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:27,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {34889#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:27,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {34890#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:27,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {34890#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:27,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {34891#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:27,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {34891#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:27,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {34892#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:27,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {34892#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:27,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {34893#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:27,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {34893#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:27,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {34894#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:27,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {34894#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:27,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {34895#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:27,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {34895#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:27,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {34896#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:27,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {34896#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:27,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {34897#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:27,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {34897#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:27,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {34898#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:27,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {34898#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:27,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {34899#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:27,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {34899#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:27,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {34900#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:27,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {34900#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:27,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {34901#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:27,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {34901#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:27,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {34902#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:27,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {34902#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:27,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {34903#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:27,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {34903#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:27,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {34904#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:27,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {34904#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:27,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {34905#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:27,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {34905#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:27,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {34906#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:27,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {34906#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:27,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {34907#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:27,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {34907#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:27,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {34908#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:27,150 INFO L290 TraceCheckUtils]: 61: Hoare triple {34908#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:27,150 INFO L290 TraceCheckUtils]: 62: Hoare triple {34909#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:27,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {34909#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:27,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {34910#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:27,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {34910#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:27,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {34911#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:27,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {34911#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:27,153 INFO L290 TraceCheckUtils]: 68: Hoare triple {34912#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:27,153 INFO L290 TraceCheckUtils]: 69: Hoare triple {34912#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:27,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {34913#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:27,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {34913#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:27,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {34914#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 73: Hoare triple {34914#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34915#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 74: Hoare triple {34915#(<= main_~i~0 34)} assume !(~i~0 < 1023); {34877#false} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 75: Hoare triple {34877#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {34877#false} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 76: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 77: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 78: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 79: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 80: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 82: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 83: Hoare triple {34877#false} assume !(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L272 TraceCheckUtils]: 84: Hoare triple {34877#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 85: Hoare triple {34877#false} ~cond := #in~cond; {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 86: Hoare triple {34877#false} assume 0 == ~cond; {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L290 TraceCheckUtils]: 87: Hoare triple {34877#false} assume !false; {34877#false} is VALID [2022-04-15 12:18:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:27,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097243673] [2022-04-15 12:18:27,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097243673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:27,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142998268] [2022-04-15 12:18:27,157 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:27,158 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:27,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 12:18:27,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:27,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:27,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:18:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:27,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:27,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {34876#true} call ULTIMATE.init(); {34876#true} is VALID [2022-04-15 12:18:27,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {34876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {34876#true} is VALID [2022-04-15 12:18:27,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 12:18:27,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 12:18:27,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {34876#true} call #t~ret5 := main(); {34876#true} is VALID [2022-04-15 12:18:27,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {34876#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34935#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:27,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {34935#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34935#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:27,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {34935#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:27,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {34882#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:27,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {34882#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:27,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {34883#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:27,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {34883#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:27,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {34884#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:27,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {34884#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:27,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {34885#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:27,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {34885#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:27,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {34886#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:27,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {34886#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:27,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {34887#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:27,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {34887#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:27,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {34888#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:27,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {34888#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:27,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {34889#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:27,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {34889#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:27,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {34890#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:27,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {34890#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:27,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {34891#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:27,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {34891#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:27,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {34892#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:27,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {34892#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:27,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {34893#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:27,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {34893#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:27,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {34894#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:27,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {34894#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:27,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {34895#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:27,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {34895#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:27,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {34896#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:27,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {34896#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:27,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {34897#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:27,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {34897#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:27,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {34898#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:27,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {34898#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:27,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {34899#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:27,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {34899#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:27,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {34900#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:27,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {34900#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:27,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {34901#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:27,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {34901#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:27,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {34902#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:27,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {34902#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:27,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {34903#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:27,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {34903#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:27,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {34904#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:27,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {34904#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:27,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {34905#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:27,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {34905#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:27,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {34906#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:27,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {34906#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:27,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {34907#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:27,904 INFO L290 TraceCheckUtils]: 59: Hoare triple {34907#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:27,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {34908#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:27,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {34908#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:27,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {34909#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:27,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {34909#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:27,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {34910#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:27,906 INFO L290 TraceCheckUtils]: 65: Hoare triple {34910#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:27,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {34911#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:27,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {34911#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:27,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {34912#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:27,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {34912#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:27,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {34913#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:27,908 INFO L290 TraceCheckUtils]: 71: Hoare triple {34913#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:27,908 INFO L290 TraceCheckUtils]: 72: Hoare triple {34914#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:27,908 INFO L290 TraceCheckUtils]: 73: Hoare triple {34914#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34915#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 74: Hoare triple {34915#(<= main_~i~0 34)} assume !(~i~0 < 1023); {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 75: Hoare triple {34877#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 76: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 77: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 78: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 79: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 82: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:27,909 INFO L290 TraceCheckUtils]: 83: Hoare triple {34877#false} assume !(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:27,910 INFO L272 TraceCheckUtils]: 84: Hoare triple {34877#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {34877#false} is VALID [2022-04-15 12:18:27,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {34877#false} ~cond := #in~cond; {34877#false} is VALID [2022-04-15 12:18:27,910 INFO L290 TraceCheckUtils]: 86: Hoare triple {34877#false} assume 0 == ~cond; {34877#false} is VALID [2022-04-15 12:18:27,910 INFO L290 TraceCheckUtils]: 87: Hoare triple {34877#false} assume !false; {34877#false} is VALID [2022-04-15 12:18:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:27,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:29,552 INFO L290 TraceCheckUtils]: 87: Hoare triple {34877#false} assume !false; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 86: Hoare triple {34877#false} assume 0 == ~cond; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 85: Hoare triple {34877#false} ~cond := #in~cond; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L272 TraceCheckUtils]: 84: Hoare triple {34877#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {34877#false} assume !(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 80: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 79: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 12:18:29,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {34877#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {34877#false} is VALID [2022-04-15 12:18:29,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {35221#(< main_~i~0 1023)} assume !(~i~0 < 1023); {34877#false} is VALID [2022-04-15 12:18:29,554 INFO L290 TraceCheckUtils]: 73: Hoare triple {35225#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35221#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:29,554 INFO L290 TraceCheckUtils]: 72: Hoare triple {35225#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35225#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:29,555 INFO L290 TraceCheckUtils]: 71: Hoare triple {35232#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35225#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:29,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {35232#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35232#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:29,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {35239#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35232#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:29,556 INFO L290 TraceCheckUtils]: 68: Hoare triple {35239#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35239#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:29,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {35246#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35239#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:29,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {35246#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35246#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:29,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {35253#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35246#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:29,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {35253#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35253#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:29,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {35260#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35253#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:29,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {35260#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35260#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:29,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {35267#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35260#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:29,559 INFO L290 TraceCheckUtils]: 60: Hoare triple {35267#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35267#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:29,559 INFO L290 TraceCheckUtils]: 59: Hoare triple {35274#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35267#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:29,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {35274#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35274#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:29,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {35281#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35274#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:29,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {35281#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35281#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:29,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {35288#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35281#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:29,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {35288#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35288#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:29,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {35295#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35288#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:29,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {35295#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35295#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:29,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {35302#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35295#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:29,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {35302#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35302#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:29,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {35309#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35302#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:29,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {35309#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35309#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:29,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {35316#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35309#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:29,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {35316#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35316#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:29,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {35323#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35316#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:29,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {35323#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35323#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:29,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {35330#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35323#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:29,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {35330#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35330#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:29,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {35337#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35330#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:29,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {35337#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35337#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:29,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {35344#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35337#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:29,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {35344#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35344#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:29,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {35351#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35344#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:29,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {35351#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35351#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:29,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {35358#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35351#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:29,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {35358#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35358#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:29,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {35365#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35358#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:29,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {35365#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35365#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:29,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {35372#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35365#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:29,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {35372#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35372#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:29,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {35379#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35372#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:29,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {35379#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35379#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:29,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {35386#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35379#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:29,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {35386#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35386#(< main_~i~0 999)} is VALID [2022-04-15 12:18:29,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {35393#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35386#(< main_~i~0 999)} is VALID [2022-04-15 12:18:29,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {35393#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35393#(< main_~i~0 998)} is VALID [2022-04-15 12:18:29,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {35400#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35393#(< main_~i~0 998)} is VALID [2022-04-15 12:18:29,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {35400#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35400#(< main_~i~0 997)} is VALID [2022-04-15 12:18:29,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {35407#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35400#(< main_~i~0 997)} is VALID [2022-04-15 12:18:29,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {35407#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35407#(< main_~i~0 996)} is VALID [2022-04-15 12:18:29,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {35414#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35407#(< main_~i~0 996)} is VALID [2022-04-15 12:18:29,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {35414#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35414#(< main_~i~0 995)} is VALID [2022-04-15 12:18:29,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {35421#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35414#(< main_~i~0 995)} is VALID [2022-04-15 12:18:29,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {35421#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35421#(< main_~i~0 994)} is VALID [2022-04-15 12:18:29,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {35428#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35421#(< main_~i~0 994)} is VALID [2022-04-15 12:18:29,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {35428#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35428#(< main_~i~0 993)} is VALID [2022-04-15 12:18:29,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {35435#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35428#(< main_~i~0 993)} is VALID [2022-04-15 12:18:29,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {35435#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35435#(< main_~i~0 992)} is VALID [2022-04-15 12:18:29,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {35442#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35435#(< main_~i~0 992)} is VALID [2022-04-15 12:18:29,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {35442#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35442#(< main_~i~0 991)} is VALID [2022-04-15 12:18:29,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {35449#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35442#(< main_~i~0 991)} is VALID [2022-04-15 12:18:29,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {35449#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35449#(< main_~i~0 990)} is VALID [2022-04-15 12:18:29,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {35456#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35449#(< main_~i~0 990)} is VALID [2022-04-15 12:18:29,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {35456#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35456#(< main_~i~0 989)} is VALID [2022-04-15 12:18:29,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {34876#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {35456#(< main_~i~0 989)} is VALID [2022-04-15 12:18:29,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {34876#true} call #t~ret5 := main(); {34876#true} is VALID [2022-04-15 12:18:29,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 12:18:29,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 12:18:29,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {34876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {34876#true} is VALID [2022-04-15 12:18:29,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {34876#true} call ULTIMATE.init(); {34876#true} is VALID [2022-04-15 12:18:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:29,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142998268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:29,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:29,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 12:18:29,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:29,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552826607] [2022-04-15 12:18:29,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552826607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:29,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:18:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713887014] [2022-04-15 12:18:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:29,579 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-15 12:18:29,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:29,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:29,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:29,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:18:29,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:29,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:18:29,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:18:29,646 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,789 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2022-04-15 12:18:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:18:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-15 12:18:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 269 transitions. [2022-04-15 12:18:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 269 transitions. [2022-04-15 12:18:33,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 269 transitions. [2022-04-15 12:18:33,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:33,987 INFO L225 Difference]: With dead ends: 239 [2022-04-15 12:18:33,987 INFO L226 Difference]: Without dead ends: 225 [2022-04-15 12:18:33,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 12:18:33,988 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 500 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:33,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 31 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-15 12:18:34,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 91. [2022-04-15 12:18:34,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:34,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 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-15 12:18:34,358 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 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-15 12:18:34,358 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 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-15 12:18:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:34,361 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2022-04-15 12:18:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 259 transitions. [2022-04-15 12:18:34,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:34,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:34,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 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 225 states. [2022-04-15 12:18:34,362 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 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 225 states. [2022-04-15 12:18:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:34,365 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2022-04-15 12:18:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 259 transitions. [2022-04-15 12:18:34,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:34,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:34,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:34,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 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-15 12:18:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 12:18:34,367 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2022-04-15 12:18:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:34,367 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 12:18:34,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:34,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 12:18:34,511 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-15 12:18:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 12:18:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 12:18:34,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:34,511 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:34,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:34,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:34,712 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash 87740757, now seen corresponding path program 71 times [2022-04-15 12:18:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:34,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281718388] [2022-04-15 12:18:34,717 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:34,717 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash 87740757, now seen corresponding path program 72 times [2022-04-15 12:18:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:34,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747444169] [2022-04-15 12:18:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:35,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {36701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {36660#true} is VALID [2022-04-15 12:18:35,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 12:18:35,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 12:18:35,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {36660#true} call ULTIMATE.init(); {36701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:35,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {36701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {36660#true} is VALID [2022-04-15 12:18:35,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 12:18:35,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 12:18:35,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {36660#true} call #t~ret5 := main(); {36660#true} is VALID [2022-04-15 12:18:35,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {36660#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36665#(= main_~i~0 0)} is VALID [2022-04-15 12:18:35,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {36665#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36665#(= main_~i~0 0)} is VALID [2022-04-15 12:18:35,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {36665#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:35,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {36666#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:35,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {36666#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:35,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {36667#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:35,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {36667#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36668#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:35,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {36668#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36668#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:35,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {36668#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36669#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:35,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {36669#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36669#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:35,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {36669#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36670#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:35,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {36670#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36670#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:35,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {36670#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36671#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:35,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {36671#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36671#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:35,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {36671#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36672#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:35,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {36672#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36672#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:35,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {36672#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36673#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:35,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {36673#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36673#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:35,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {36673#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36674#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:35,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {36674#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36674#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:35,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {36674#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36675#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:35,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {36675#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36675#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:35,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {36675#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36676#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:35,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {36676#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36676#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:35,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {36676#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36677#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:35,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {36677#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36677#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:35,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {36677#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36678#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:35,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {36678#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36678#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:35,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {36678#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36679#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:35,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {36679#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36679#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:35,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {36679#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36680#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:35,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {36680#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36680#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:35,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {36680#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36681#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:35,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {36681#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36681#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:35,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {36681#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36682#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:35,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {36682#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36682#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:35,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {36682#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36683#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:35,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {36683#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36683#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:35,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {36683#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36684#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:35,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {36684#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36684#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:35,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {36684#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36685#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:35,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {36685#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36685#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:35,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {36685#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36686#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:35,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {36686#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36686#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:35,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {36686#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36687#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:35,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {36687#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36687#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:35,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {36687#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36688#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:35,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {36688#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36688#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:35,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {36688#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36689#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:35,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {36689#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36689#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:35,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {36689#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36690#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:35,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {36690#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36690#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:35,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {36690#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36691#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:35,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {36691#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36691#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:35,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {36691#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36692#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:35,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {36692#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36692#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:35,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {36692#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36693#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:35,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {36693#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36693#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:35,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {36693#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36694#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:35,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {36694#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36694#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:35,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {36694#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36695#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:35,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {36695#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36695#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:35,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {36695#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36696#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:35,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {36696#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36696#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:35,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {36696#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36697#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:35,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {36697#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36697#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:35,411 INFO L290 TraceCheckUtils]: 71: Hoare triple {36697#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36698#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:35,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {36698#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36698#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:35,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {36698#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36699#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:35,412 INFO L290 TraceCheckUtils]: 74: Hoare triple {36699#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36699#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:35,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {36699#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36700#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:35,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {36700#(<= main_~i~0 35)} assume !(~i~0 < 1023); {36661#false} is VALID [2022-04-15 12:18:35,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {36661#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {36661#false} is VALID [2022-04-15 12:18:35,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {36661#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {36661#false} assume !!(0 != #t~mem4);havoc #t~mem4; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {36661#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {36661#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {36661#false} assume !!(0 != #t~mem4);havoc #t~mem4; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 83: Hoare triple {36661#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 84: Hoare triple {36661#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 85: Hoare triple {36661#false} assume !(0 != #t~mem4);havoc #t~mem4; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L272 TraceCheckUtils]: 86: Hoare triple {36661#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {36661#false} ~cond := #in~cond; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 88: Hoare triple {36661#false} assume 0 == ~cond; {36661#false} is VALID [2022-04-15 12:18:35,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {36661#false} assume !false; {36661#false} is VALID [2022-04-15 12:18:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747444169] [2022-04-15 12:18:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747444169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703417411] [2022-04-15 12:18:35,415 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:35,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:35,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:35,417 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:35,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 12:18:35,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:18:35,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:35,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:35,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:35,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {36660#true} call ULTIMATE.init(); {36660#true} is VALID [2022-04-15 12:18:35,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {36660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {36660#true} is VALID [2022-04-15 12:18:35,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 12:18:35,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 12:18:35,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {36660#true} call #t~ret5 := main(); {36660#true} is VALID [2022-04-15 12:18:35,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {36660#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 74: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:35,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {36660#true} assume !(~i~0 < 1023); {36660#true} is VALID [2022-04-15 12:18:35,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {36660#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {36936#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:35,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {36936#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36936#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:35,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {36936#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {36936#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:35,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {36936#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:35,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {36666#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36666#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:35,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {36666#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:35,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {36666#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:35,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {36667#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36667#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:35,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {36667#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:35,882 INFO L272 TraceCheckUtils]: 86: Hoare triple {36667#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:35,882 INFO L290 TraceCheckUtils]: 87: Hoare triple {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:35,883 INFO L290 TraceCheckUtils]: 88: Hoare triple {36968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36661#false} is VALID [2022-04-15 12:18:35,883 INFO L290 TraceCheckUtils]: 89: Hoare triple {36661#false} assume !false; {36661#false} is VALID [2022-04-15 12:18:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 12:18:35,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:36,177 INFO L290 TraceCheckUtils]: 89: Hoare triple {36661#false} assume !false; {36661#false} is VALID [2022-04-15 12:18:36,178 INFO L290 TraceCheckUtils]: 88: Hoare triple {36968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36661#false} is VALID [2022-04-15 12:18:36,178 INFO L290 TraceCheckUtils]: 87: Hoare triple {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:36,179 INFO L272 TraceCheckUtils]: 86: Hoare triple {36984#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:36,179 INFO L290 TraceCheckUtils]: 85: Hoare triple {36984#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {36984#(<= main_~i~0 1024)} is VALID [2022-04-15 12:18:36,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {36984#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36984#(<= main_~i~0 1024)} is VALID [2022-04-15 12:18:36,180 INFO L290 TraceCheckUtils]: 83: Hoare triple {36994#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36984#(<= main_~i~0 1024)} is VALID [2022-04-15 12:18:36,180 INFO L290 TraceCheckUtils]: 82: Hoare triple {36994#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {36994#(<= main_~i~0 1023)} is VALID [2022-04-15 12:18:36,180 INFO L290 TraceCheckUtils]: 81: Hoare triple {36994#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36994#(<= main_~i~0 1023)} is VALID [2022-04-15 12:18:36,181 INFO L290 TraceCheckUtils]: 80: Hoare triple {37004#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36994#(<= main_~i~0 1023)} is VALID [2022-04-15 12:18:36,181 INFO L290 TraceCheckUtils]: 79: Hoare triple {37004#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {37004#(<= main_~i~0 1022)} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {37004#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37004#(<= main_~i~0 1022)} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {36660#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {37004#(<= main_~i~0 1022)} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 76: Hoare triple {36660#true} assume !(~i~0 < 1023); {36660#true} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 71: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 70: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {36660#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {36660#true} call #t~ret5 := main(); {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {36660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {36660#true} is VALID [2022-04-15 12:18:36,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {36660#true} call ULTIMATE.init(); {36660#true} is VALID [2022-04-15 12:18:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 12:18:36,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703417411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:36,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:36,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 7, 7] total 45 [2022-04-15 12:18:36,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:36,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281718388] [2022-04-15 12:18:36,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281718388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:36,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:36,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:18:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889708543] [2022-04-15 12:18:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 12:18:36,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:36,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,288 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-15 12:18:36,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:18:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:18:36,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=1113, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:36,289 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:40,602 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2022-04-15 12:18:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:18:40,603 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 12:18:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 276 transitions. [2022-04-15 12:18:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 276 transitions. [2022-04-15 12:18:40,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 276 transitions. [2022-04-15 12:18:40,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:40,807 INFO L225 Difference]: With dead ends: 245 [2022-04-15 12:18:40,807 INFO L226 Difference]: Without dead ends: 231 [2022-04-15 12:18:40,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2380, Invalid=4100, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:18:40,808 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 569 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:40,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 31 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-15 12:18:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 93. [2022-04-15 12:18:41,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:41,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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-15 12:18:41,190 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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-15 12:18:41,191 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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-15 12:18:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:41,193 INFO L93 Difference]: Finished difference Result 231 states and 266 transitions. [2022-04-15 12:18:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2022-04-15 12:18:41,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:41,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:41,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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 231 states. [2022-04-15 12:18:41,194 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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 231 states. [2022-04-15 12:18:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:41,196 INFO L93 Difference]: Finished difference Result 231 states and 266 transitions. [2022-04-15 12:18:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2022-04-15 12:18:41,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:41,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:41,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:41,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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-15 12:18:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-15 12:18:41,197 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2022-04-15 12:18:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:41,197 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-15 12:18:41,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:41,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 94 transitions. [2022-04-15 12:18:41,350 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-15 12:18:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-15 12:18:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 12:18:41,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:41,350 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:41,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 12:18:41,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 12:18:41,551 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 952143607, now seen corresponding path program 73 times [2022-04-15 12:18:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1163998614] [2022-04-15 12:18:41,556 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:41,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash 952143607, now seen corresponding path program 74 times [2022-04-15 12:18:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:41,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398830795] [2022-04-15 12:18:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:42,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:42,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {38499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {38457#true} is VALID [2022-04-15 12:18:42,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 12:18:42,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 12:18:42,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {38457#true} call ULTIMATE.init(); {38499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:42,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {38499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {38457#true} is VALID [2022-04-15 12:18:42,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 12:18:42,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 12:18:42,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {38457#true} call #t~ret5 := main(); {38457#true} is VALID [2022-04-15 12:18:42,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {38457#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38462#(= main_~i~0 0)} is VALID [2022-04-15 12:18:42,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {38462#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -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 0)} is VALID [2022-04-15 12:18:42,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {38462#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:42,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {38463#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 12:18:42,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {38463#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:42,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {38464#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 12:18:42,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {38464#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:42,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {38465#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -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 3)} is VALID [2022-04-15 12:18:42,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {38465#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:42,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {38466#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 12:18:42,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {38466#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:42,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {38467#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -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 5)} is VALID [2022-04-15 12:18:42,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {38467#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:42,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {38468#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:42,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {38468#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:42,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {38469#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:42,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {38469#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:42,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {38470#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:42,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {38470#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:42,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {38471#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:42,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {38471#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:42,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {38472#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:42,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {38472#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:42,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {38473#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:42,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {38473#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:42,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {38474#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:42,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {38474#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:42,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {38475#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:42,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {38475#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:42,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {38476#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:42,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {38476#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:42,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {38477#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:42,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {38477#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:42,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {38478#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:42,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {38478#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:42,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {38479#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:42,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {38479#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:42,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {38480#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:42,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {38480#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:42,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {38481#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:42,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {38481#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:42,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {38482#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:42,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {38482#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:42,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {38483#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:42,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {38483#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:42,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {38484#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:42,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {38484#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:42,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {38485#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:42,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {38485#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:42,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {38486#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:42,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {38486#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:42,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {38487#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:42,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {38487#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38488#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:42,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {38488#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -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 26)} is VALID [2022-04-15 12:18:42,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {38488#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:42,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {38489#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:42,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {38489#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:42,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {38490#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:42,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {38490#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:42,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {38491#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:42,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {38491#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:42,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {38492#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:42,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {38492#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:42,168 INFO L290 TraceCheckUtils]: 68: Hoare triple {38493#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:42,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {38493#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:42,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {38494#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:42,169 INFO L290 TraceCheckUtils]: 71: Hoare triple {38494#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:42,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {38495#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:42,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {38495#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:42,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {38496#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:42,171 INFO L290 TraceCheckUtils]: 75: Hoare triple {38496#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:42,171 INFO L290 TraceCheckUtils]: 76: Hoare triple {38497#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:42,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {38497#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38498#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {38498#(<= main_~i~0 36)} assume !(~i~0 < 1023); {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {38458#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 82: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 84: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 85: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 86: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 87: Hoare triple {38458#false} assume !(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L272 TraceCheckUtils]: 88: Hoare triple {38458#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 89: Hoare triple {38458#false} ~cond := #in~cond; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 90: Hoare triple {38458#false} assume 0 == ~cond; {38458#false} is VALID [2022-04-15 12:18:42,172 INFO L290 TraceCheckUtils]: 91: Hoare triple {38458#false} assume !false; {38458#false} is VALID [2022-04-15 12:18:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:42,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398830795] [2022-04-15 12:18:42,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398830795] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26952377] [2022-04-15 12:18:42,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:42,174 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:18:42,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 12:18:42,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:42,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:42,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:18:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:42,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:42,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {38457#true} call ULTIMATE.init(); {38457#true} is VALID [2022-04-15 12:18:42,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {38457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {38457#true} is VALID [2022-04-15 12:18:42,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 12:18:42,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 12:18:42,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {38457#true} call #t~ret5 := main(); {38457#true} is VALID [2022-04-15 12:18:42,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {38457#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38518#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:42,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {38518#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38518#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:42,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {38518#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:42,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {38463#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 12:18:42,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {38463#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:42,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {38464#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 12:18:42,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {38464#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:42,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {38465#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -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 3)} is VALID [2022-04-15 12:18:42,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {38465#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:42,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {38466#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 12:18:42,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {38466#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:42,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {38467#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -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 5)} is VALID [2022-04-15 12:18:42,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {38467#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:42,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {38468#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:42,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {38468#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:42,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {38469#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:42,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {38469#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:42,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {38470#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:42,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {38470#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:42,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {38471#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:42,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {38471#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:42,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {38472#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:42,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {38472#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:42,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {38473#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:42,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {38473#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:42,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {38474#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:42,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {38474#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:42,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {38475#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:42,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {38475#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:42,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {38476#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:42,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {38476#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:42,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {38477#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:42,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {38477#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:42,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {38478#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:42,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {38478#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:42,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {38479#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:42,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {38479#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:42,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {38480#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:42,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {38480#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:42,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {38481#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:42,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {38481#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:42,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {38482#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:42,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {38482#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:42,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {38483#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:42,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {38483#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:42,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {38484#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:42,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {38484#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:42,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {38485#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:42,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {38485#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:42,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {38486#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:42,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {38486#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:42,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {38487#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:42,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {38487#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38488#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:42,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {38488#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -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 26)} is VALID [2022-04-15 12:18:42,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {38488#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:42,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {38489#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:42,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {38489#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:42,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {38490#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:42,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {38490#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:42,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {38491#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:42,907 INFO L290 TraceCheckUtils]: 65: Hoare triple {38491#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:42,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {38492#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:42,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {38492#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:42,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {38493#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:42,908 INFO L290 TraceCheckUtils]: 69: Hoare triple {38493#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:42,908 INFO L290 TraceCheckUtils]: 70: Hoare triple {38494#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:42,908 INFO L290 TraceCheckUtils]: 71: Hoare triple {38494#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:42,909 INFO L290 TraceCheckUtils]: 72: Hoare triple {38495#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:42,909 INFO L290 TraceCheckUtils]: 73: Hoare triple {38495#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:42,909 INFO L290 TraceCheckUtils]: 74: Hoare triple {38496#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:42,910 INFO L290 TraceCheckUtils]: 75: Hoare triple {38496#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:42,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {38497#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:42,910 INFO L290 TraceCheckUtils]: 77: Hoare triple {38497#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38498#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 78: Hoare triple {38498#(<= main_~i~0 36)} assume !(~i~0 < 1023); {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 79: Hoare triple {38458#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 80: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 81: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 83: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 84: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 85: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {38458#false} assume !(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:42,911 INFO L272 TraceCheckUtils]: 88: Hoare triple {38458#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {38458#false} is VALID [2022-04-15 12:18:42,912 INFO L290 TraceCheckUtils]: 89: Hoare triple {38458#false} ~cond := #in~cond; {38458#false} is VALID [2022-04-15 12:18:42,912 INFO L290 TraceCheckUtils]: 90: Hoare triple {38458#false} assume 0 == ~cond; {38458#false} is VALID [2022-04-15 12:18:42,912 INFO L290 TraceCheckUtils]: 91: Hoare triple {38458#false} assume !false; {38458#false} is VALID [2022-04-15 12:18:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:42,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:44,712 INFO L290 TraceCheckUtils]: 91: Hoare triple {38458#false} assume !false; {38458#false} is VALID [2022-04-15 12:18:44,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {38458#false} assume 0 == ~cond; {38458#false} is VALID [2022-04-15 12:18:44,712 INFO L290 TraceCheckUtils]: 89: Hoare triple {38458#false} ~cond := #in~cond; {38458#false} is VALID [2022-04-15 12:18:44,712 INFO L272 TraceCheckUtils]: 88: Hoare triple {38458#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {38458#false} is VALID [2022-04-15 12:18:44,712 INFO L290 TraceCheckUtils]: 87: Hoare triple {38458#false} assume !(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:44,712 INFO L290 TraceCheckUtils]: 86: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:44,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 84: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 83: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 82: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {38458#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {38458#false} is VALID [2022-04-15 12:18:44,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {38816#(< main_~i~0 1023)} assume !(~i~0 < 1023); {38458#false} is VALID [2022-04-15 12:18:44,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {38820#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38816#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:44,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {38820#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38820#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:44,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {38827#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38820#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:44,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {38827#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38827#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:44,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {38834#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38827#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:44,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {38834#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38834#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:44,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {38841#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38834#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:44,716 INFO L290 TraceCheckUtils]: 70: Hoare triple {38841#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38841#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:44,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {38848#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38841#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:44,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {38848#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38848#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:44,717 INFO L290 TraceCheckUtils]: 67: Hoare triple {38855#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38848#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:44,717 INFO L290 TraceCheckUtils]: 66: Hoare triple {38855#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38855#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:44,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {38862#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38855#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:44,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {38862#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38862#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:44,718 INFO L290 TraceCheckUtils]: 63: Hoare triple {38869#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38862#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:44,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {38869#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38869#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:44,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {38876#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38869#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:44,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {38876#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38876#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:44,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {38883#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38876#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:44,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {38883#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38883#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:44,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {38890#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38883#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:44,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {38890#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38890#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:44,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {38897#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38890#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:44,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {38897#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38897#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:44,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {38904#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38897#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:44,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {38904#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38904#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:44,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {38911#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38904#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:44,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {38911#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38911#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:44,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {38918#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38911#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:44,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {38918#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38918#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:44,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {38925#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38918#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:44,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {38925#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38925#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:44,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {38932#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38925#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:44,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {38932#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38932#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:44,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {38939#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38932#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:44,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {38939#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38939#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:44,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {38946#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38939#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:44,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {38946#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38946#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:44,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {38953#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38946#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:44,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {38953#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38953#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:44,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {38960#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38953#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:44,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {38960#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38960#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:44,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {38967#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38960#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:44,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {38967#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38967#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:44,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {38974#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38967#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:44,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {38974#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38974#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:44,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {38981#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38974#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:44,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {38981#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38981#(< main_~i~0 999)} is VALID [2022-04-15 12:18:44,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {38988#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38981#(< main_~i~0 999)} is VALID [2022-04-15 12:18:44,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {38988#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38988#(< main_~i~0 998)} is VALID [2022-04-15 12:18:44,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {38995#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38988#(< main_~i~0 998)} is VALID [2022-04-15 12:18:44,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {38995#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38995#(< main_~i~0 997)} is VALID [2022-04-15 12:18:44,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {39002#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38995#(< main_~i~0 997)} is VALID [2022-04-15 12:18:44,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {39002#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39002#(< main_~i~0 996)} is VALID [2022-04-15 12:18:44,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {39009#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39002#(< main_~i~0 996)} is VALID [2022-04-15 12:18:44,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {39009#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39009#(< main_~i~0 995)} is VALID [2022-04-15 12:18:44,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {39016#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39009#(< main_~i~0 995)} is VALID [2022-04-15 12:18:44,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {39016#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39016#(< main_~i~0 994)} is VALID [2022-04-15 12:18:44,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {39023#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39016#(< main_~i~0 994)} is VALID [2022-04-15 12:18:44,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {39023#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39023#(< main_~i~0 993)} is VALID [2022-04-15 12:18:44,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {39030#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39023#(< main_~i~0 993)} is VALID [2022-04-15 12:18:44,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {39030#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39030#(< main_~i~0 992)} is VALID [2022-04-15 12:18:44,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {39037#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39030#(< main_~i~0 992)} is VALID [2022-04-15 12:18:44,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {39037#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39037#(< main_~i~0 991)} is VALID [2022-04-15 12:18:44,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {39044#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39037#(< main_~i~0 991)} is VALID [2022-04-15 12:18:44,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {39044#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39044#(< main_~i~0 990)} is VALID [2022-04-15 12:18:44,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {39051#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39044#(< main_~i~0 990)} is VALID [2022-04-15 12:18:44,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {39051#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39051#(< main_~i~0 989)} is VALID [2022-04-15 12:18:44,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {39058#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39051#(< main_~i~0 989)} is VALID [2022-04-15 12:18:44,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {39058#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39058#(< main_~i~0 988)} is VALID [2022-04-15 12:18:44,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {39065#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39058#(< main_~i~0 988)} is VALID [2022-04-15 12:18:44,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {39065#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39065#(< main_~i~0 987)} is VALID [2022-04-15 12:18:44,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {38457#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {39065#(< main_~i~0 987)} is VALID [2022-04-15 12:18:44,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {38457#true} call #t~ret5 := main(); {38457#true} is VALID [2022-04-15 12:18:44,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 12:18:44,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 12:18:44,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {38457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {38457#true} is VALID [2022-04-15 12:18:44,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {38457#true} call ULTIMATE.init(); {38457#true} is VALID [2022-04-15 12:18:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:44,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26952377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:44,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:44,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-15 12:18:44,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:44,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1163998614] [2022-04-15 12:18:44,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1163998614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:44,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:44,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:18:44,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467345090] [2022-04-15 12:18:44,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 12:18:44,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:44,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:44,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:44,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:18:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:44,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:18:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 12:18:44,794 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:49,177 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2022-04-15 12:18:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:18:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 12:18:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 283 transitions. [2022-04-15 12:18:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 283 transitions. [2022-04-15 12:18:49,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 283 transitions. [2022-04-15 12:18:49,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:49,382 INFO L225 Difference]: With dead ends: 251 [2022-04-15 12:18:49,382 INFO L226 Difference]: Without dead ends: 237 [2022-04-15 12:18:49,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 12:18:49,383 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 481 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:49,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 46 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-15 12:18:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 95. [2022-04-15 12:18:49,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:49,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 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-15 12:18:49,778 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 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-15 12:18:49,778 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 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-15 12:18:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:49,780 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2022-04-15 12:18:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 273 transitions. [2022-04-15 12:18:49,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:49,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:49,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 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 237 states. [2022-04-15 12:18:49,781 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 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 237 states. [2022-04-15 12:18:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:49,783 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2022-04-15 12:18:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 273 transitions. [2022-04-15 12:18:49,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:49,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:49,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:49,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 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-15 12:18:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-04-15 12:18:49,784 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2022-04-15 12:18:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:49,785 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-04-15 12:18:49,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:49,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 96 transitions. [2022-04-15 12:18:49,933 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-15 12:18:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 12:18:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 12:18:49,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:49,934 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:49,953 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-15 12:18:50,134 WARN L460 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-15 12:18:50,135 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1580372967, now seen corresponding path program 75 times [2022-04-15 12:18:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277182756] [2022-04-15 12:18:50,139 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:50,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1580372967, now seen corresponding path program 76 times [2022-04-15 12:18:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:50,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506745489] [2022-04-15 12:18:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:50,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {40372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {40329#true} is VALID [2022-04-15 12:18:50,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 12:18:50,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 12:18:50,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {40329#true} call ULTIMATE.init(); {40372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:50,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {40372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {40329#true} is VALID [2022-04-15 12:18:50,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 12:18:50,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 12:18:50,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {40329#true} call #t~ret5 := main(); {40329#true} is VALID [2022-04-15 12:18:50,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {40329#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40334#(= main_~i~0 0)} is VALID [2022-04-15 12:18:50,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {40334#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40334#(= main_~i~0 0)} is VALID [2022-04-15 12:18:50,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {40334#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:50,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {40335#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:50,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {40335#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:50,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {40336#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:50,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {40336#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:50,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {40337#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:50,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {40337#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:50,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {40338#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:50,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {40338#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:50,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {40339#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:50,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {40339#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:50,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {40340#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:50,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {40340#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:50,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {40341#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:50,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {40341#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:50,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {40342#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:50,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {40342#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:50,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {40343#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:50,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {40343#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:50,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {40344#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:50,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {40344#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:50,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {40345#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:50,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {40345#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:50,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {40346#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:50,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {40346#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:50,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {40347#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:50,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {40347#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:50,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {40348#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:50,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {40348#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:50,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {40349#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:50,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {40349#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:50,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {40350#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:50,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {40350#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:50,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {40351#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:50,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {40351#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:50,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {40352#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:50,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {40352#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:50,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {40353#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:50,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {40353#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:50,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {40354#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:50,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {40354#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:50,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {40355#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:50,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {40355#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:50,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {40356#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:50,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {40356#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:50,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {40357#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:50,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {40357#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:50,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {40358#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:50,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {40358#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:50,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {40359#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:50,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {40359#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:50,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {40360#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:50,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {40360#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:50,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {40361#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:50,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {40361#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:50,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {40362#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:50,843 INFO L290 TraceCheckUtils]: 63: Hoare triple {40362#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:50,843 INFO L290 TraceCheckUtils]: 64: Hoare triple {40363#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:50,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {40363#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:50,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {40364#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:50,845 INFO L290 TraceCheckUtils]: 67: Hoare triple {40364#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:50,845 INFO L290 TraceCheckUtils]: 68: Hoare triple {40365#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:50,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {40365#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:50,846 INFO L290 TraceCheckUtils]: 70: Hoare triple {40366#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:50,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {40366#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:50,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {40367#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:50,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {40367#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:50,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {40368#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:50,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {40368#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:50,849 INFO L290 TraceCheckUtils]: 76: Hoare triple {40369#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:50,849 INFO L290 TraceCheckUtils]: 77: Hoare triple {40369#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:50,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {40370#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:50,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {40370#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40371#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 80: Hoare triple {40371#(<= main_~i~0 37)} assume !(~i~0 < 1023); {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 81: Hoare triple {40330#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 82: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 83: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 84: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 87: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 88: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:50,851 INFO L290 TraceCheckUtils]: 89: Hoare triple {40330#false} assume !(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:50,852 INFO L272 TraceCheckUtils]: 90: Hoare triple {40330#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {40330#false} is VALID [2022-04-15 12:18:50,852 INFO L290 TraceCheckUtils]: 91: Hoare triple {40330#false} ~cond := #in~cond; {40330#false} is VALID [2022-04-15 12:18:50,852 INFO L290 TraceCheckUtils]: 92: Hoare triple {40330#false} assume 0 == ~cond; {40330#false} is VALID [2022-04-15 12:18:50,852 INFO L290 TraceCheckUtils]: 93: Hoare triple {40330#false} assume !false; {40330#false} is VALID [2022-04-15 12:18:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506745489] [2022-04-15 12:18:50,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506745489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122665758] [2022-04-15 12:18:50,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:50,856 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-15 12:18:50,857 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-15 12:18:51,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:51,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:51,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 12:18:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:51,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:51,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {40329#true} call ULTIMATE.init(); {40329#true} is VALID [2022-04-15 12:18:51,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {40329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {40329#true} is VALID [2022-04-15 12:18:51,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 12:18:51,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 12:18:51,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {40329#true} call #t~ret5 := main(); {40329#true} is VALID [2022-04-15 12:18:51,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {40329#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40391#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:51,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {40391#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40391#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:51,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {40391#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:51,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {40335#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:51,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {40335#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:51,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {40336#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:51,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {40336#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:51,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {40337#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:51,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {40337#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:51,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {40338#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:51,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {40338#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:51,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {40339#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:51,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {40339#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:51,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {40340#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:51,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {40340#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:51,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {40341#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:51,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {40341#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:51,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {40342#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:51,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {40342#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:51,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {40343#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:51,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {40343#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:51,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {40344#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:51,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {40344#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:51,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {40345#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:51,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {40345#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:51,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {40346#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:51,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {40346#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:51,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {40347#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:51,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {40347#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:51,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {40348#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:51,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {40348#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:51,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {40349#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:51,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {40349#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:51,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {40350#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:51,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {40350#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:51,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {40351#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:51,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {40351#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:51,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {40352#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:51,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {40352#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:51,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {40353#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:51,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {40353#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:51,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {40354#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:51,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {40354#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:51,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {40355#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:51,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {40355#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:51,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {40356#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:51,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {40356#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:51,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {40357#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:51,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {40357#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:51,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {40358#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:51,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {40358#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:51,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {40359#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:51,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {40359#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:51,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {40360#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:51,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {40360#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:51,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {40361#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:51,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {40361#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:51,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {40362#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:51,807 INFO L290 TraceCheckUtils]: 63: Hoare triple {40362#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:51,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {40363#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:51,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {40363#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:51,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {40364#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:51,808 INFO L290 TraceCheckUtils]: 67: Hoare triple {40364#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:51,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {40365#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:51,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {40365#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:51,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {40366#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:51,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {40366#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:51,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {40367#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:51,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {40367#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:51,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {40368#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:51,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {40368#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:51,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {40369#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:51,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {40369#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:51,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {40370#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:51,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {40370#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40371#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 80: Hoare triple {40371#(<= main_~i~0 37)} assume !(~i~0 < 1023); {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 81: Hoare triple {40330#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 83: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {40330#false} assume !(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:51,814 INFO L272 TraceCheckUtils]: 90: Hoare triple {40330#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {40330#false} is VALID [2022-04-15 12:18:51,815 INFO L290 TraceCheckUtils]: 91: Hoare triple {40330#false} ~cond := #in~cond; {40330#false} is VALID [2022-04-15 12:18:51,815 INFO L290 TraceCheckUtils]: 92: Hoare triple {40330#false} assume 0 == ~cond; {40330#false} is VALID [2022-04-15 12:18:51,815 INFO L290 TraceCheckUtils]: 93: Hoare triple {40330#false} assume !false; {40330#false} is VALID [2022-04-15 12:18:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:51,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:54,256 INFO L290 TraceCheckUtils]: 93: Hoare triple {40330#false} assume !false; {40330#false} is VALID [2022-04-15 12:18:54,256 INFO L290 TraceCheckUtils]: 92: Hoare triple {40330#false} assume 0 == ~cond; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 91: Hoare triple {40330#false} ~cond := #in~cond; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L272 TraceCheckUtils]: 90: Hoare triple {40330#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {40330#false} assume !(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 83: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 12:18:54,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 12:18:54,258 INFO L290 TraceCheckUtils]: 81: Hoare triple {40330#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {40330#false} is VALID [2022-04-15 12:18:54,258 INFO L290 TraceCheckUtils]: 80: Hoare triple {40695#(< main_~i~0 1023)} assume !(~i~0 < 1023); {40330#false} is VALID [2022-04-15 12:18:54,258 INFO L290 TraceCheckUtils]: 79: Hoare triple {40699#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40695#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:54,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {40699#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40699#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:54,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {40706#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40699#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:54,260 INFO L290 TraceCheckUtils]: 76: Hoare triple {40706#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40706#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:54,260 INFO L290 TraceCheckUtils]: 75: Hoare triple {40713#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40706#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:54,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {40713#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40713#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:54,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {40720#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40713#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:54,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {40720#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40720#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:54,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {40727#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40720#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:54,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {40727#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40727#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:54,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {40734#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40727#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:54,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {40734#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40734#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:54,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {40741#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40734#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:54,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {40741#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40741#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:54,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {40748#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40741#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:54,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {40748#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40748#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:54,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {40755#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40748#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:54,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {40755#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40755#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:54,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {40762#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40755#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:54,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {40762#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40762#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:54,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {40769#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40762#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:54,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {40769#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40769#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:54,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {40776#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40769#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:54,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {40776#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40776#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:54,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {40783#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40776#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:54,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {40783#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40783#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:54,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {40790#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40783#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:54,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {40790#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40790#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:54,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {40797#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40790#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:54,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {40797#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40797#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:54,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {40804#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40797#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:54,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {40804#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40804#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:54,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {40811#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40804#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:54,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {40811#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40811#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:54,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {40818#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40811#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:54,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {40818#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40818#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:54,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {40825#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40818#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:54,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {40825#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40825#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:54,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {40832#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40825#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:54,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {40832#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40832#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:54,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {40839#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40832#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:54,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {40839#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40839#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:54,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {40846#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40839#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:54,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {40846#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40846#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:54,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {40853#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40846#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:54,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {40853#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40853#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:54,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {40860#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40853#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:54,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {40860#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40860#(< main_~i~0 999)} is VALID [2022-04-15 12:18:54,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {40867#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40860#(< main_~i~0 999)} is VALID [2022-04-15 12:18:54,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {40867#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40867#(< main_~i~0 998)} is VALID [2022-04-15 12:18:54,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {40874#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40867#(< main_~i~0 998)} is VALID [2022-04-15 12:18:54,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {40874#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40874#(< main_~i~0 997)} is VALID [2022-04-15 12:18:54,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {40881#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40874#(< main_~i~0 997)} is VALID [2022-04-15 12:18:54,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {40881#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40881#(< main_~i~0 996)} is VALID [2022-04-15 12:18:54,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {40888#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40881#(< main_~i~0 996)} is VALID [2022-04-15 12:18:54,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {40888#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40888#(< main_~i~0 995)} is VALID [2022-04-15 12:18:54,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {40895#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40888#(< main_~i~0 995)} is VALID [2022-04-15 12:18:54,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {40895#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40895#(< main_~i~0 994)} is VALID [2022-04-15 12:18:54,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {40902#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40895#(< main_~i~0 994)} is VALID [2022-04-15 12:18:54,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {40902#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40902#(< main_~i~0 993)} is VALID [2022-04-15 12:18:54,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {40909#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40902#(< main_~i~0 993)} is VALID [2022-04-15 12:18:54,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {40909#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40909#(< main_~i~0 992)} is VALID [2022-04-15 12:18:54,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {40916#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40909#(< main_~i~0 992)} is VALID [2022-04-15 12:18:54,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {40916#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40916#(< main_~i~0 991)} is VALID [2022-04-15 12:18:54,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {40923#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40916#(< main_~i~0 991)} is VALID [2022-04-15 12:18:54,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {40923#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40923#(< main_~i~0 990)} is VALID [2022-04-15 12:18:54,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {40930#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40923#(< main_~i~0 990)} is VALID [2022-04-15 12:18:54,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {40930#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40930#(< main_~i~0 989)} is VALID [2022-04-15 12:18:54,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {40937#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40930#(< main_~i~0 989)} is VALID [2022-04-15 12:18:54,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {40937#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40937#(< main_~i~0 988)} is VALID [2022-04-15 12:18:54,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {40944#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40937#(< main_~i~0 988)} is VALID [2022-04-15 12:18:54,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {40944#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40944#(< main_~i~0 987)} is VALID [2022-04-15 12:18:54,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {40951#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40944#(< main_~i~0 987)} is VALID [2022-04-15 12:18:54,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {40951#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40951#(< main_~i~0 986)} is VALID [2022-04-15 12:18:54,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {40329#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40951#(< main_~i~0 986)} is VALID [2022-04-15 12:18:54,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {40329#true} call #t~ret5 := main(); {40329#true} is VALID [2022-04-15 12:18:54,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 12:18:54,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 12:18:54,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {40329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {40329#true} is VALID [2022-04-15 12:18:54,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {40329#true} call ULTIMATE.init(); {40329#true} is VALID [2022-04-15 12:18:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:18:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122665758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:54,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:54,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 12:18:54,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277182756] [2022-04-15 12:18:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277182756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:54,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:54,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:18:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681956645] [2022-04-15 12:18:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 12:18:54,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:54,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:54,362 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-15 12:18:54,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:18:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:18:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 12:18:54,364 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:59,453 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2022-04-15 12:18:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:18:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 12:18:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 290 transitions. [2022-04-15 12:18:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 290 transitions. [2022-04-15 12:18:59,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 290 transitions. [2022-04-15 12:18:59,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:59,664 INFO L225 Difference]: With dead ends: 257 [2022-04-15 12:18:59,664 INFO L226 Difference]: Without dead ends: 243 [2022-04-15 12:18:59,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 12:18:59,665 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 544 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:59,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 36 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-04-15 12:19:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 97. [2022-04-15 12:19:00,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:00,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:00,088 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:00,088 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:00,090 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2022-04-15 12:19:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 280 transitions. [2022-04-15 12:19:00,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:00,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:00,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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 243 states. [2022-04-15 12:19:00,091 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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 243 states. [2022-04-15 12:19:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:00,093 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2022-04-15 12:19:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 280 transitions. [2022-04-15 12:19:00,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:00,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:00,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:00,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-15 12:19:00,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2022-04-15 12:19:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:00,095 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-15 12:19:00,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:00,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-15 12:19:00,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 12:19:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 12:19:00,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:00,248 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:00,266 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-15 12:19:00,451 WARN L460 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-15 12:19:00,451 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -82343749, now seen corresponding path program 77 times [2022-04-15 12:19:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:00,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373153013] [2022-04-15 12:19:00,456 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:00,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash -82343749, now seen corresponding path program 78 times [2022-04-15 12:19:00,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:00,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901452567] [2022-04-15 12:19:00,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:01,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {42289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {42245#true} is VALID [2022-04-15 12:19:01,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 12:19:01,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 12:19:01,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {42245#true} call ULTIMATE.init(); {42289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:01,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {42289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {42245#true} is VALID [2022-04-15 12:19:01,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 12:19:01,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 12:19:01,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {42245#true} call #t~ret5 := main(); {42245#true} is VALID [2022-04-15 12:19:01,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {42245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42250#(= main_~i~0 0)} is VALID [2022-04-15 12:19:01,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {42250#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42250#(= main_~i~0 0)} is VALID [2022-04-15 12:19:01,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {42250#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:01,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {42251#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:01,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {42251#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:01,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {42252#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:01,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {42252#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42253#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:01,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {42253#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42253#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:01,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {42253#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42254#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:01,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {42254#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42254#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:01,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {42254#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42255#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:01,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {42255#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42255#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:01,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {42255#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42256#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:01,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {42256#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42256#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:01,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {42256#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42257#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:01,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {42257#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42257#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:01,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {42257#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42258#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:01,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {42258#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42258#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:01,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {42258#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42259#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:01,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {42259#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42259#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:01,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {42259#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42260#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:01,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {42260#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42260#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:01,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {42260#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42261#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:01,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {42261#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42261#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:01,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {42261#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42262#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:01,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {42262#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42262#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:01,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {42262#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42263#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:01,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {42263#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42263#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:01,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {42263#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42264#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:01,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {42264#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42264#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:01,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {42264#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42265#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:01,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {42265#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42265#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:01,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {42265#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42266#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:01,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {42266#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42266#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:01,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {42266#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42267#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:01,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {42267#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42267#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:01,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {42267#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42268#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:01,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {42268#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42268#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:01,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {42268#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42269#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:01,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {42269#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42269#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:01,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {42269#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42270#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:01,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {42270#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42270#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:01,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {42270#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42271#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:01,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {42271#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42271#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:01,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {42271#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42272#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:01,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {42272#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42272#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:01,190 INFO L290 TraceCheckUtils]: 51: Hoare triple {42272#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42273#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:01,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {42273#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42273#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:01,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {42273#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42274#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:01,191 INFO L290 TraceCheckUtils]: 54: Hoare triple {42274#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42274#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:01,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {42274#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42275#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:01,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {42275#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42275#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:01,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {42275#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42276#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:01,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {42276#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42276#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:01,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {42276#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42277#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:01,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {42277#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42277#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:01,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {42277#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42278#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:01,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {42278#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42278#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:01,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {42278#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42279#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:01,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {42279#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42279#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:01,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {42279#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42280#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:01,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {42280#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42280#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:01,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {42280#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42281#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:01,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {42281#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42281#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:01,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {42281#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42282#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:01,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {42282#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42282#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:01,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {42282#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42283#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:01,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {42283#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42283#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:01,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {42283#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42284#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:01,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {42284#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42284#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:01,198 INFO L290 TraceCheckUtils]: 75: Hoare triple {42284#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42285#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:01,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {42285#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42285#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:01,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {42285#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42286#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:01,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {42286#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42286#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:01,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {42286#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42287#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:01,199 INFO L290 TraceCheckUtils]: 80: Hoare triple {42287#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42287#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 81: Hoare triple {42287#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42288#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 82: Hoare triple {42288#(<= main_~i~0 38)} assume !(~i~0 < 1023); {42246#false} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 83: Hoare triple {42246#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {42246#false} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 84: Hoare triple {42246#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42246#false} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 85: Hoare triple {42246#false} assume !!(0 != #t~mem4);havoc #t~mem4; {42246#false} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 86: Hoare triple {42246#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42246#false} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 87: Hoare triple {42246#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42246#false} is VALID [2022-04-15 12:19:01,200 INFO L290 TraceCheckUtils]: 88: Hoare triple {42246#false} assume !!(0 != #t~mem4);havoc #t~mem4; {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L290 TraceCheckUtils]: 89: Hoare triple {42246#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L290 TraceCheckUtils]: 90: Hoare triple {42246#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L290 TraceCheckUtils]: 91: Hoare triple {42246#false} assume !(0 != #t~mem4);havoc #t~mem4; {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L272 TraceCheckUtils]: 92: Hoare triple {42246#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L290 TraceCheckUtils]: 93: Hoare triple {42246#false} ~cond := #in~cond; {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L290 TraceCheckUtils]: 94: Hoare triple {42246#false} assume 0 == ~cond; {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L290 TraceCheckUtils]: 95: Hoare triple {42246#false} assume !false; {42246#false} is VALID [2022-04-15 12:19:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:01,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901452567] [2022-04-15 12:19:01,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901452567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:01,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690174191] [2022-04-15 12:19:01,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:01,203 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-15 12:19:01,204 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-15 12:19:01,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:19:01,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:01,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:19:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:01,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:01,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {42245#true} call ULTIMATE.init(); {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {42245#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {42245#true} call #t~ret5 := main(); {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {42245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 65: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 67: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 69: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 70: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 71: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 72: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,655 INFO L290 TraceCheckUtils]: 74: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 75: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 76: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 77: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 78: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 79: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 80: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 81: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 82: Hoare triple {42245#true} assume !(~i~0 < 1023); {42245#true} is VALID [2022-04-15 12:19:01,656 INFO L290 TraceCheckUtils]: 83: Hoare triple {42245#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {42542#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:01,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {42542#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42542#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:01,657 INFO L290 TraceCheckUtils]: 85: Hoare triple {42542#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {42542#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:01,657 INFO L290 TraceCheckUtils]: 86: Hoare triple {42542#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:01,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {42251#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42251#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:01,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {42251#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:01,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {42251#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:01,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {42252#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42252#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:01,659 INFO L290 TraceCheckUtils]: 91: Hoare triple {42252#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:01,659 INFO L272 TraceCheckUtils]: 92: Hoare triple {42252#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:01,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:01,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {42574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42246#false} is VALID [2022-04-15 12:19:01,660 INFO L290 TraceCheckUtils]: 95: Hoare triple {42246#false} assume !false; {42246#false} is VALID [2022-04-15 12:19:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 12:19:01,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:01,928 INFO L290 TraceCheckUtils]: 95: Hoare triple {42246#false} assume !false; {42246#false} is VALID [2022-04-15 12:19:01,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {42574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42246#false} is VALID [2022-04-15 12:19:01,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:01,930 INFO L272 TraceCheckUtils]: 92: Hoare triple {42590#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:01,930 INFO L290 TraceCheckUtils]: 91: Hoare triple {42590#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {42590#(<= main_~i~0 1024)} is VALID [2022-04-15 12:19:01,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {42590#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42590#(<= main_~i~0 1024)} is VALID [2022-04-15 12:19:01,931 INFO L290 TraceCheckUtils]: 89: Hoare triple {42600#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42590#(<= main_~i~0 1024)} is VALID [2022-04-15 12:19:01,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {42600#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {42600#(<= main_~i~0 1023)} is VALID [2022-04-15 12:19:01,931 INFO L290 TraceCheckUtils]: 87: Hoare triple {42600#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42600#(<= main_~i~0 1023)} is VALID [2022-04-15 12:19:01,932 INFO L290 TraceCheckUtils]: 86: Hoare triple {42610#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42600#(<= main_~i~0 1023)} is VALID [2022-04-15 12:19:01,932 INFO L290 TraceCheckUtils]: 85: Hoare triple {42610#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {42610#(<= main_~i~0 1022)} is VALID [2022-04-15 12:19:01,932 INFO L290 TraceCheckUtils]: 84: Hoare triple {42610#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42610#(<= main_~i~0 1022)} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 83: Hoare triple {42245#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {42610#(<= main_~i~0 1022)} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 82: Hoare triple {42245#true} assume !(~i~0 < 1023); {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 81: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 80: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 79: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 78: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 77: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 76: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 75: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 74: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {42245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {42245#true} call #t~ret5 := main(); {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {42245#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {42245#true} is VALID [2022-04-15 12:19:01,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {42245#true} call ULTIMATE.init(); {42245#true} is VALID [2022-04-15 12:19:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 12:19:01,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690174191] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:01,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:01,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 7, 7] total 48 [2022-04-15 12:19:01,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:01,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373153013] [2022-04-15 12:19:01,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373153013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:01,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:01,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:19:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807337637] [2022-04-15 12:19:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 12:19:01,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:01,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:02,005 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-15 12:19:02,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:19:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:19:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=996, Invalid=1260, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:19:02,006 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:08,054 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2022-04-15 12:19:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 12:19:08,055 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 12:19:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 297 transitions. [2022-04-15 12:19:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 297 transitions. [2022-04-15 12:19:08,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 297 transitions. [2022-04-15 12:19:08,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:08,322 INFO L225 Difference]: With dead ends: 263 [2022-04-15 12:19:08,322 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 12:19:08,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2752, Invalid=4730, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:19:08,323 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 505 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:08,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 31 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:19:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 12:19:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 99. [2022-04-15 12:19:08,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:08,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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-15 12:19:08,966 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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-15 12:19:08,966 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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-15 12:19:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:08,970 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2022-04-15 12:19:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2022-04-15 12:19:08,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:08,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:08,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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 249 states. [2022-04-15 12:19:08,971 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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 249 states. [2022-04-15 12:19:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:08,974 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2022-04-15 12:19:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2022-04-15 12:19:08,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:08,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:08,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:08,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 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-15 12:19:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-15 12:19:08,977 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2022-04-15 12:19:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:09,003 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-15 12:19:09,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:09,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-15 12:19:09,274 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-15 12:19:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 12:19:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 12:19:09,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:09,275 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:09,302 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-15 12:19:09,499 WARN L460 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-15 12:19:09,500 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 709690589, now seen corresponding path program 79 times [2022-04-15 12:19:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:09,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188819940] [2022-04-15 12:19:09,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:09,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash 709690589, now seen corresponding path program 80 times [2022-04-15 12:19:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:09,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951464315] [2022-04-15 12:19:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:10,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {44216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {44171#true} is VALID [2022-04-15 12:19:10,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 12:19:10,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 12:19:10,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {44171#true} call ULTIMATE.init(); {44216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:10,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {44216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {44171#true} is VALID [2022-04-15 12:19:10,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 12:19:10,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 12:19:10,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {44171#true} call #t~ret5 := main(); {44171#true} is VALID [2022-04-15 12:19:10,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {44171#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44176#(= main_~i~0 0)} is VALID [2022-04-15 12:19:10,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {44176#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44176#(= main_~i~0 0)} is VALID [2022-04-15 12:19:10,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {44176#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:10,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {44177#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:10,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {44177#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:10,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {44178#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:10,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {44178#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:10,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {44179#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:10,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {44179#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:10,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {44180#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:10,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {44180#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:10,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {44181#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:10,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {44181#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:10,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {44182#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:10,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {44182#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:10,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {44183#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:10,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {44183#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:10,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {44184#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:10,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {44184#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:10,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {44185#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:10,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {44185#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:10,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {44186#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:10,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {44186#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:10,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {44187#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:10,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {44187#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:10,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {44188#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:10,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {44188#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:10,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {44189#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:10,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {44189#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:10,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {44190#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:10,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {44190#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:10,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {44191#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:10,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {44191#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:10,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {44192#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:10,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {44192#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:10,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {44193#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:10,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {44193#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:10,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {44194#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:10,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {44194#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:10,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {44195#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:10,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {44195#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:10,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {44196#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:10,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {44196#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:10,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {44197#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:10,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {44197#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:10,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {44198#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:10,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {44198#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:10,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {44199#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:10,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {44199#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:10,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {44200#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:10,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {44200#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:10,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {44201#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:10,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {44201#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:10,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {44202#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:10,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {44202#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:10,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {44203#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:10,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {44203#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:10,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {44204#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:10,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {44204#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:10,347 INFO L290 TraceCheckUtils]: 64: Hoare triple {44205#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:10,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {44205#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:10,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {44206#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:10,348 INFO L290 TraceCheckUtils]: 67: Hoare triple {44206#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:10,348 INFO L290 TraceCheckUtils]: 68: Hoare triple {44207#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:10,349 INFO L290 TraceCheckUtils]: 69: Hoare triple {44207#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:10,349 INFO L290 TraceCheckUtils]: 70: Hoare triple {44208#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:10,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {44208#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:10,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {44209#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:10,350 INFO L290 TraceCheckUtils]: 73: Hoare triple {44209#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:10,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {44210#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:10,351 INFO L290 TraceCheckUtils]: 75: Hoare triple {44210#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:10,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {44211#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:10,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {44211#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:10,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {44212#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:10,353 INFO L290 TraceCheckUtils]: 79: Hoare triple {44212#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:10,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {44213#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:10,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {44213#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:10,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {44214#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:10,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {44214#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44215#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {44215#(<= main_~i~0 39)} assume !(~i~0 < 1023); {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {44172#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 90: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:10,355 INFO L290 TraceCheckUtils]: 91: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L290 TraceCheckUtils]: 93: Hoare triple {44172#false} assume !(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L272 TraceCheckUtils]: 94: Hoare triple {44172#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#false} ~cond := #in~cond; {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {44172#false} assume 0 == ~cond; {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {44172#false} assume !false; {44172#false} is VALID [2022-04-15 12:19:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:10,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951464315] [2022-04-15 12:19:10,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951464315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:10,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027008455] [2022-04-15 12:19:10,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:10,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:10,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:10,358 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-15 12:19:10,360 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-15 12:19:10,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:10,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 12:19:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:10,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:11,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {44171#true} call ULTIMATE.init(); {44171#true} is VALID [2022-04-15 12:19:11,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {44171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {44171#true} is VALID [2022-04-15 12:19:11,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 12:19:11,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 12:19:11,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {44171#true} call #t~ret5 := main(); {44171#true} is VALID [2022-04-15 12:19:11,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {44171#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44235#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:11,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {44235#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44235#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:11,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {44235#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:11,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {44177#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:11,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {44177#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:11,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {44178#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:11,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {44178#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:11,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {44179#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:11,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {44179#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:11,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {44180#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:11,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {44180#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:11,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {44181#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:11,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {44181#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:11,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {44182#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:11,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {44182#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:11,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {44183#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:11,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {44183#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:11,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {44184#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:11,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {44184#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:11,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {44185#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:11,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {44185#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:11,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {44186#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:11,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {44186#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:11,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {44187#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:11,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {44187#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:11,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {44188#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:11,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {44188#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:11,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {44189#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:11,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {44189#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:11,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {44190#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:11,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {44190#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:11,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {44191#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:11,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {44191#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:11,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {44192#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:11,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {44192#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:11,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {44193#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:11,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {44193#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:11,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {44194#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:11,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {44194#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:11,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {44195#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:11,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {44195#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:11,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {44196#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:11,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {44196#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:11,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {44197#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:11,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {44197#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:11,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {44198#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:11,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {44198#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:11,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {44199#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:11,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {44199#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:11,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {44200#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:11,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {44200#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:11,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {44201#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:11,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {44201#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:11,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {44202#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:11,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {44202#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:11,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {44203#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:11,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {44203#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:11,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {44204#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:11,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {44204#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:11,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {44205#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:11,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {44205#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:11,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {44206#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:11,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {44206#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:11,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {44207#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:11,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {44207#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:11,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {44208#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:11,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {44208#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:11,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {44209#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:11,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {44209#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:11,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {44210#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:11,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {44210#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:11,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {44211#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:11,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {44211#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:11,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {44212#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:11,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {44212#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:11,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {44213#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:11,204 INFO L290 TraceCheckUtils]: 81: Hoare triple {44213#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:11,204 INFO L290 TraceCheckUtils]: 82: Hoare triple {44214#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 83: Hoare triple {44214#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44215#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 84: Hoare triple {44215#(<= main_~i~0 39)} assume !(~i~0 < 1023); {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {44172#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 86: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 88: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 90: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 91: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 12:19:11,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:11,206 INFO L290 TraceCheckUtils]: 93: Hoare triple {44172#false} assume !(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:11,206 INFO L272 TraceCheckUtils]: 94: Hoare triple {44172#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {44172#false} is VALID [2022-04-15 12:19:11,206 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#false} ~cond := #in~cond; {44172#false} is VALID [2022-04-15 12:19:11,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {44172#false} assume 0 == ~cond; {44172#false} is VALID [2022-04-15 12:19:11,206 INFO L290 TraceCheckUtils]: 97: Hoare triple {44172#false} assume !false; {44172#false} is VALID [2022-04-15 12:19:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:11,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:13,224 INFO L290 TraceCheckUtils]: 97: Hoare triple {44172#false} assume !false; {44172#false} is VALID [2022-04-15 12:19:13,224 INFO L290 TraceCheckUtils]: 96: Hoare triple {44172#false} assume 0 == ~cond; {44172#false} is VALID [2022-04-15 12:19:13,224 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#false} ~cond := #in~cond; {44172#false} is VALID [2022-04-15 12:19:13,224 INFO L272 TraceCheckUtils]: 94: Hoare triple {44172#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {44172#false} is VALID [2022-04-15 12:19:13,224 INFO L290 TraceCheckUtils]: 93: Hoare triple {44172#false} assume !(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:13,224 INFO L290 TraceCheckUtils]: 92: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 91: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 90: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 87: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 86: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 85: Hoare triple {44172#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {44172#false} is VALID [2022-04-15 12:19:13,225 INFO L290 TraceCheckUtils]: 84: Hoare triple {44551#(< main_~i~0 1023)} assume !(~i~0 < 1023); {44172#false} is VALID [2022-04-15 12:19:13,226 INFO L290 TraceCheckUtils]: 83: Hoare triple {44555#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44551#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:13,226 INFO L290 TraceCheckUtils]: 82: Hoare triple {44555#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44555#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:13,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {44562#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44555#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:13,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {44562#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44562#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:13,227 INFO L290 TraceCheckUtils]: 79: Hoare triple {44569#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44562#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:13,227 INFO L290 TraceCheckUtils]: 78: Hoare triple {44569#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44569#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:13,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {44576#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44569#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:13,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {44576#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44576#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:13,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {44583#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44576#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:13,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {44583#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44583#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:13,229 INFO L290 TraceCheckUtils]: 73: Hoare triple {44590#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44583#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:13,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {44590#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44590#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:13,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {44597#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44590#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:13,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {44597#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44597#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:13,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {44604#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44597#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:13,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {44604#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44604#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:13,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {44611#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44604#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:13,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {44611#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44611#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:13,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {44618#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44611#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:13,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {44618#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44618#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:13,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {44625#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44618#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:13,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {44625#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44625#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:13,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {44632#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44625#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:13,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {44632#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44632#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:13,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {44639#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44632#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:13,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {44639#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44639#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:13,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {44646#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44639#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:13,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {44646#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44646#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:13,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {44653#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44646#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:13,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {44653#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44653#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:13,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {44660#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44653#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:13,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {44660#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44660#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:13,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {44667#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44660#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:13,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {44667#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44667#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:13,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {44674#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44667#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:13,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {44674#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44674#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:13,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {44681#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44674#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:13,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {44681#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44681#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:13,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {44688#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44681#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:13,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {44688#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44688#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:13,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {44695#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44688#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:13,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {44695#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44695#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:13,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {44702#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44695#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:13,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {44702#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44702#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:13,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {44709#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44702#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:13,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {44709#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44709#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:13,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {44716#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44709#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:13,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {44716#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44716#(< main_~i~0 999)} is VALID [2022-04-15 12:19:13,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {44723#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44716#(< main_~i~0 999)} is VALID [2022-04-15 12:19:13,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {44723#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44723#(< main_~i~0 998)} is VALID [2022-04-15 12:19:13,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {44730#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44723#(< main_~i~0 998)} is VALID [2022-04-15 12:19:13,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {44730#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44730#(< main_~i~0 997)} is VALID [2022-04-15 12:19:13,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {44737#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44730#(< main_~i~0 997)} is VALID [2022-04-15 12:19:13,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {44737#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44737#(< main_~i~0 996)} is VALID [2022-04-15 12:19:13,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {44744#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44737#(< main_~i~0 996)} is VALID [2022-04-15 12:19:13,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {44744#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44744#(< main_~i~0 995)} is VALID [2022-04-15 12:19:13,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {44751#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44744#(< main_~i~0 995)} is VALID [2022-04-15 12:19:13,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {44751#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44751#(< main_~i~0 994)} is VALID [2022-04-15 12:19:13,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {44758#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44751#(< main_~i~0 994)} is VALID [2022-04-15 12:19:13,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {44758#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44758#(< main_~i~0 993)} is VALID [2022-04-15 12:19:13,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {44765#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44758#(< main_~i~0 993)} is VALID [2022-04-15 12:19:13,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {44765#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44765#(< main_~i~0 992)} is VALID [2022-04-15 12:19:13,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {44772#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44765#(< main_~i~0 992)} is VALID [2022-04-15 12:19:13,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {44772#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44772#(< main_~i~0 991)} is VALID [2022-04-15 12:19:13,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {44779#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44772#(< main_~i~0 991)} is VALID [2022-04-15 12:19:13,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {44779#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44779#(< main_~i~0 990)} is VALID [2022-04-15 12:19:13,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {44786#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44779#(< main_~i~0 990)} is VALID [2022-04-15 12:19:13,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {44786#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44786#(< main_~i~0 989)} is VALID [2022-04-15 12:19:13,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {44793#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44786#(< main_~i~0 989)} is VALID [2022-04-15 12:19:13,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {44793#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44793#(< main_~i~0 988)} is VALID [2022-04-15 12:19:13,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {44800#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44793#(< main_~i~0 988)} is VALID [2022-04-15 12:19:13,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {44800#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44800#(< main_~i~0 987)} is VALID [2022-04-15 12:19:13,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {44807#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44800#(< main_~i~0 987)} is VALID [2022-04-15 12:19:13,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {44807#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44807#(< main_~i~0 986)} is VALID [2022-04-15 12:19:13,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {44814#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44807#(< main_~i~0 986)} is VALID [2022-04-15 12:19:13,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {44814#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44814#(< main_~i~0 985)} is VALID [2022-04-15 12:19:13,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {44821#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44814#(< main_~i~0 985)} is VALID [2022-04-15 12:19:13,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {44821#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44821#(< main_~i~0 984)} is VALID [2022-04-15 12:19:13,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {44171#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44821#(< main_~i~0 984)} is VALID [2022-04-15 12:19:13,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {44171#true} call #t~ret5 := main(); {44171#true} is VALID [2022-04-15 12:19:13,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 12:19:13,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 12:19:13,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {44171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {44171#true} is VALID [2022-04-15 12:19:13,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {44171#true} call ULTIMATE.init(); {44171#true} is VALID [2022-04-15 12:19:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:13,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027008455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:13,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:13,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-15 12:19:13,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:13,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188819940] [2022-04-15 12:19:13,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188819940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:13,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:13,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 12:19:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7538813] [2022-04-15 12:19:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 12:19:13,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:13,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:13,323 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-15 12:19:13,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 12:19:13,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:13,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 12:19:13,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 12:19:13,324 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:18,630 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2022-04-15 12:19:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 12:19:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 12:19:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 304 transitions. [2022-04-15 12:19:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 304 transitions. [2022-04-15 12:19:18,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 304 transitions. [2022-04-15 12:19:18,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:18,856 INFO L225 Difference]: With dead ends: 269 [2022-04-15 12:19:18,856 INFO L226 Difference]: Without dead ends: 255 [2022-04-15 12:19:18,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 12:19:18,858 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 585 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:18,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 41 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:19:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-15 12:19:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 101. [2022-04-15 12:19:19,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:19,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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-15 12:19:19,349 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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-15 12:19:19,349 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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-15 12:19:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:19,352 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2022-04-15 12:19:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2022-04-15 12:19:19,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:19,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:19,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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 255 states. [2022-04-15 12:19:19,353 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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 255 states. [2022-04-15 12:19:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:19,357 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2022-04-15 12:19:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2022-04-15 12:19:19,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:19,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:19,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:19,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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-15 12:19:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-04-15 12:19:19,359 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2022-04-15 12:19:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:19,359 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-04-15 12:19:19,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:19,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 102 transitions. [2022-04-15 12:19:19,548 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-15 12:19:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 12:19:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 12:19:19,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:19,548 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:19,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:19,748 WARN L460 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-15 12:19:19,749 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1645478015, now seen corresponding path program 81 times [2022-04-15 12:19:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:19,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943892016] [2022-04-15 12:19:19,763 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:19,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1645478015, now seen corresponding path program 82 times [2022-04-15 12:19:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:19,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775226452] [2022-04-15 12:19:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:20,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {46221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {46175#true} is VALID [2022-04-15 12:19:20,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 12:19:20,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 12:19:20,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {46175#true} call ULTIMATE.init(); {46221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:20,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {46221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {46175#true} is VALID [2022-04-15 12:19:20,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 12:19:20,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 12:19:20,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {46175#true} call #t~ret5 := main(); {46175#true} is VALID [2022-04-15 12:19:20,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {46175#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46180#(= main_~i~0 0)} is VALID [2022-04-15 12:19:20,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {46180#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46180#(= main_~i~0 0)} is VALID [2022-04-15 12:19:20,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {46180#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:20,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {46181#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:20,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {46181#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:20,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {46182#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:20,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {46182#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:20,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {46183#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:20,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {46183#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:20,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {46184#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:20,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {46184#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:20,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {46185#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:20,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {46185#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:20,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {46186#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:20,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {46186#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:20,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {46187#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:20,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {46187#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:20,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {46188#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:20,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {46188#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:20,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {46189#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:20,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {46189#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:20,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {46190#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:20,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {46190#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:20,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {46191#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:20,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {46191#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:20,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {46192#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:20,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {46192#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:20,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {46193#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:20,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {46193#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:20,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {46194#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:20,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {46194#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:20,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {46195#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:20,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {46195#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:20,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {46196#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:20,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {46196#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:20,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {46197#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:20,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {46197#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:20,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {46198#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:20,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {46198#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:20,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {46199#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:20,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {46199#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:20,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {46200#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:20,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {46200#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:20,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {46201#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:20,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {46201#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:20,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {46202#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:20,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {46202#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:20,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {46203#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:20,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {46203#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:20,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {46204#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:20,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {46204#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:20,533 INFO L290 TraceCheckUtils]: 56: Hoare triple {46205#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:20,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {46205#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:20,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {46206#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:20,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {46206#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:20,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {46207#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:20,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {46207#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:20,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {46208#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:20,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {46208#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:20,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {46209#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:20,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {46209#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:20,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {46210#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:20,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {46210#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:20,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {46211#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:20,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {46211#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:20,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {46212#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:20,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {46212#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:20,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {46213#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:20,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {46213#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:20,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {46214#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:20,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {46214#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:20,539 INFO L290 TraceCheckUtils]: 76: Hoare triple {46215#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:20,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {46215#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:20,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {46216#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:20,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {46216#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:20,541 INFO L290 TraceCheckUtils]: 80: Hoare triple {46217#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:20,541 INFO L290 TraceCheckUtils]: 81: Hoare triple {46217#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:20,541 INFO L290 TraceCheckUtils]: 82: Hoare triple {46218#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:20,542 INFO L290 TraceCheckUtils]: 83: Hoare triple {46218#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:20,542 INFO L290 TraceCheckUtils]: 84: Hoare triple {46219#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:20,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {46219#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46220#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 86: Hoare triple {46220#(<= main_~i~0 40)} assume !(~i~0 < 1023); {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {46176#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 92: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 93: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 94: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L290 TraceCheckUtils]: 95: Hoare triple {46176#false} assume !(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:20,543 INFO L272 TraceCheckUtils]: 96: Hoare triple {46176#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {46176#false} is VALID [2022-04-15 12:19:20,544 INFO L290 TraceCheckUtils]: 97: Hoare triple {46176#false} ~cond := #in~cond; {46176#false} is VALID [2022-04-15 12:19:20,544 INFO L290 TraceCheckUtils]: 98: Hoare triple {46176#false} assume 0 == ~cond; {46176#false} is VALID [2022-04-15 12:19:20,544 INFO L290 TraceCheckUtils]: 99: Hoare triple {46176#false} assume !false; {46176#false} is VALID [2022-04-15 12:19:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:20,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775226452] [2022-04-15 12:19:20,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775226452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:20,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353834239] [2022-04-15 12:19:20,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:20,549 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-15 12:19:20,550 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-15 12:19:20,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:20,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:20,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:19:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:20,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:21,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {46175#true} call ULTIMATE.init(); {46175#true} is VALID [2022-04-15 12:19:21,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {46175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {46175#true} is VALID [2022-04-15 12:19:21,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 12:19:21,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 12:19:21,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {46175#true} call #t~ret5 := main(); {46175#true} is VALID [2022-04-15 12:19:21,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {46175#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46240#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:21,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {46240#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46240#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:21,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {46240#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:21,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {46181#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:21,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {46181#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:21,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {46182#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:21,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {46182#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:21,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {46183#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:21,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {46183#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:21,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {46184#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:21,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {46184#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:21,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {46185#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:21,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {46185#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:21,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {46186#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:21,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {46186#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:21,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {46187#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:21,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {46187#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:21,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {46188#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:21,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {46188#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:21,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {46189#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:21,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {46189#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:21,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {46190#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:21,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {46190#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:21,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {46191#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:21,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {46191#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:21,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {46192#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:21,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {46192#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:21,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {46193#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:21,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {46193#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:21,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {46194#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:21,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {46194#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:21,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {46195#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:21,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {46195#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:21,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {46196#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:21,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {46196#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:21,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {46197#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:21,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {46197#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:21,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {46198#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:21,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {46198#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:21,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {46199#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:21,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {46199#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:21,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {46200#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:21,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {46200#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:21,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {46201#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:21,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {46201#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:21,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {46202#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:21,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {46202#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:21,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {46203#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:21,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {46203#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:21,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {46204#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:21,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {46204#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:21,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {46205#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:21,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {46205#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:21,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {46206#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:21,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {46206#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:21,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {46207#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:21,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {46207#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:21,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {46208#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:21,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {46208#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:21,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {46209#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:21,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {46209#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:21,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {46210#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:21,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {46210#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:21,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {46211#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:21,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {46211#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:21,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {46212#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:21,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {46212#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:21,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {46213#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:21,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {46213#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:21,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {46214#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:21,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {46214#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:21,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {46215#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:21,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {46215#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:21,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {46216#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:21,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {46216#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:21,388 INFO L290 TraceCheckUtils]: 80: Hoare triple {46217#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:21,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {46217#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:21,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {46218#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:21,389 INFO L290 TraceCheckUtils]: 83: Hoare triple {46218#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:21,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {46219#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:21,390 INFO L290 TraceCheckUtils]: 85: Hoare triple {46219#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46220#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:21,390 INFO L290 TraceCheckUtils]: 86: Hoare triple {46220#(<= main_~i~0 40)} assume !(~i~0 < 1023); {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {46176#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 90: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 91: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 92: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 93: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 95: Hoare triple {46176#false} assume !(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L272 TraceCheckUtils]: 96: Hoare triple {46176#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 97: Hoare triple {46176#false} ~cond := #in~cond; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 98: Hoare triple {46176#false} assume 0 == ~cond; {46176#false} is VALID [2022-04-15 12:19:21,391 INFO L290 TraceCheckUtils]: 99: Hoare triple {46176#false} assume !false; {46176#false} is VALID [2022-04-15 12:19:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:21,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:24,117 INFO L290 TraceCheckUtils]: 99: Hoare triple {46176#false} assume !false; {46176#false} is VALID [2022-04-15 12:19:24,117 INFO L290 TraceCheckUtils]: 98: Hoare triple {46176#false} assume 0 == ~cond; {46176#false} is VALID [2022-04-15 12:19:24,117 INFO L290 TraceCheckUtils]: 97: Hoare triple {46176#false} ~cond := #in~cond; {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L272 TraceCheckUtils]: 96: Hoare triple {46176#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 95: Hoare triple {46176#false} assume !(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 94: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 12:19:24,118 INFO L290 TraceCheckUtils]: 87: Hoare triple {46176#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {46176#false} is VALID [2022-04-15 12:19:24,119 INFO L290 TraceCheckUtils]: 86: Hoare triple {46562#(< main_~i~0 1023)} assume !(~i~0 < 1023); {46176#false} is VALID [2022-04-15 12:19:24,119 INFO L290 TraceCheckUtils]: 85: Hoare triple {46566#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46562#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:24,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {46566#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46566#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:24,120 INFO L290 TraceCheckUtils]: 83: Hoare triple {46573#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46566#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:24,120 INFO L290 TraceCheckUtils]: 82: Hoare triple {46573#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46573#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:24,121 INFO L290 TraceCheckUtils]: 81: Hoare triple {46580#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46573#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:24,121 INFO L290 TraceCheckUtils]: 80: Hoare triple {46580#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46580#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:24,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {46587#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46580#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:24,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {46587#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46587#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:24,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {46594#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46587#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:24,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {46594#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46594#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:24,123 INFO L290 TraceCheckUtils]: 75: Hoare triple {46601#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46594#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:24,124 INFO L290 TraceCheckUtils]: 74: Hoare triple {46601#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46601#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:24,124 INFO L290 TraceCheckUtils]: 73: Hoare triple {46608#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46601#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:24,124 INFO L290 TraceCheckUtils]: 72: Hoare triple {46608#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46608#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:24,125 INFO L290 TraceCheckUtils]: 71: Hoare triple {46615#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46608#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:24,125 INFO L290 TraceCheckUtils]: 70: Hoare triple {46615#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46615#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:24,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {46622#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46615#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:24,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {46622#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46622#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:24,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {46629#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46622#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:24,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {46629#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46629#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:24,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {46636#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46629#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:24,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {46636#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46636#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:24,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {46643#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46636#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:24,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {46643#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46643#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:24,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {46650#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46643#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:24,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {46650#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46650#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:24,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {46657#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46650#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:24,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {46657#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46657#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:24,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {46664#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46657#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:24,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {46664#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46664#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:24,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {46671#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46664#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:24,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {46671#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46671#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:24,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {46678#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46671#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:24,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {46678#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46678#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:24,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {46685#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46678#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:24,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {46685#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46685#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:24,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {46692#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46685#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:24,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {46692#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46692#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:24,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {46699#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46692#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:24,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {46699#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46699#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:24,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {46706#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46699#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:24,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {46706#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46706#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:24,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {46713#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46706#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:24,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {46713#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46713#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:24,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {46720#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46713#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:24,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {46720#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46720#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:24,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {46727#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46720#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:24,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {46727#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46727#(< main_~i~0 999)} is VALID [2022-04-15 12:19:24,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {46734#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46727#(< main_~i~0 999)} is VALID [2022-04-15 12:19:24,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {46734#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46734#(< main_~i~0 998)} is VALID [2022-04-15 12:19:24,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {46741#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46734#(< main_~i~0 998)} is VALID [2022-04-15 12:19:24,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {46741#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46741#(< main_~i~0 997)} is VALID [2022-04-15 12:19:24,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {46748#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46741#(< main_~i~0 997)} is VALID [2022-04-15 12:19:24,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {46748#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46748#(< main_~i~0 996)} is VALID [2022-04-15 12:19:24,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {46755#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46748#(< main_~i~0 996)} is VALID [2022-04-15 12:19:24,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {46755#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46755#(< main_~i~0 995)} is VALID [2022-04-15 12:19:24,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {46762#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46755#(< main_~i~0 995)} is VALID [2022-04-15 12:19:24,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {46762#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46762#(< main_~i~0 994)} is VALID [2022-04-15 12:19:24,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {46769#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46762#(< main_~i~0 994)} is VALID [2022-04-15 12:19:24,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {46769#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46769#(< main_~i~0 993)} is VALID [2022-04-15 12:19:24,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {46776#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46769#(< main_~i~0 993)} is VALID [2022-04-15 12:19:24,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {46776#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46776#(< main_~i~0 992)} is VALID [2022-04-15 12:19:24,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {46783#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46776#(< main_~i~0 992)} is VALID [2022-04-15 12:19:24,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {46783#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46783#(< main_~i~0 991)} is VALID [2022-04-15 12:19:24,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {46790#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46783#(< main_~i~0 991)} is VALID [2022-04-15 12:19:24,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {46790#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46790#(< main_~i~0 990)} is VALID [2022-04-15 12:19:24,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {46797#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46790#(< main_~i~0 990)} is VALID [2022-04-15 12:19:24,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {46797#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46797#(< main_~i~0 989)} is VALID [2022-04-15 12:19:24,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {46804#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46797#(< main_~i~0 989)} is VALID [2022-04-15 12:19:24,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {46804#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46804#(< main_~i~0 988)} is VALID [2022-04-15 12:19:24,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {46811#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46804#(< main_~i~0 988)} is VALID [2022-04-15 12:19:24,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {46811#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46811#(< main_~i~0 987)} is VALID [2022-04-15 12:19:24,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {46818#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46811#(< main_~i~0 987)} is VALID [2022-04-15 12:19:24,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {46818#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46818#(< main_~i~0 986)} is VALID [2022-04-15 12:19:24,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {46825#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46818#(< main_~i~0 986)} is VALID [2022-04-15 12:19:24,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {46825#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46825#(< main_~i~0 985)} is VALID [2022-04-15 12:19:24,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {46832#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46825#(< main_~i~0 985)} is VALID [2022-04-15 12:19:24,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {46832#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46832#(< main_~i~0 984)} is VALID [2022-04-15 12:19:24,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {46839#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46832#(< main_~i~0 984)} is VALID [2022-04-15 12:19:24,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {46839#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46839#(< main_~i~0 983)} is VALID [2022-04-15 12:19:24,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {46175#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46839#(< main_~i~0 983)} is VALID [2022-04-15 12:19:24,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {46175#true} call #t~ret5 := main(); {46175#true} is VALID [2022-04-15 12:19:24,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 12:19:24,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 12:19:24,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {46175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {46175#true} is VALID [2022-04-15 12:19:24,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {46175#true} call ULTIMATE.init(); {46175#true} is VALID [2022-04-15 12:19:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:24,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353834239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:24,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:24,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 12:19:24,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:24,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943892016] [2022-04-15 12:19:24,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943892016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:24,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:24,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 12:19:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813768376] [2022-04-15 12:19:24,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:24,153 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 12:19:24,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:24,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:24,224 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-15 12:19:24,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 12:19:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 12:19:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 12:19:24,226 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:30,899 INFO L93 Difference]: Finished difference Result 275 states and 316 transitions. [2022-04-15 12:19:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 12:19:30,899 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 12:19:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 311 transitions. [2022-04-15 12:19:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 311 transitions. [2022-04-15 12:19:30,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 311 transitions. [2022-04-15 12:19:31,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:31,234 INFO L225 Difference]: With dead ends: 275 [2022-04-15 12:19:31,234 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 12:19:31,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 12:19:31,236 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 643 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:31,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 36 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:19:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 12:19:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 103. [2022-04-15 12:19:31,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:31,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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-15 12:19:31,807 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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-15 12:19:31,807 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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-15 12:19:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:31,810 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-04-15 12:19:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2022-04-15 12:19:31,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:31,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:31,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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 261 states. [2022-04-15 12:19:31,810 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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 261 states. [2022-04-15 12:19:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:31,813 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-04-15 12:19:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2022-04-15 12:19:31,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:31,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:31,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:31,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 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-15 12:19:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-15 12:19:31,815 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2022-04-15 12:19:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:31,815 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-15 12:19:31,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:31,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 104 transitions. [2022-04-15 12:19:31,993 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-15 12:19:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-15 12:19:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 12:19:31,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:31,994 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:32,015 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-15 12:19:32,195 WARN L460 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-15 12:19:32,196 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1005937759, now seen corresponding path program 83 times [2022-04-15 12:19:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:32,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358171711] [2022-04-15 12:19:32,252 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:32,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1005937759, now seen corresponding path program 84 times [2022-04-15 12:19:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119225076] [2022-04-15 12:19:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:33,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:33,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {48270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {48223#true} is VALID [2022-04-15 12:19:33,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 12:19:33,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 12:19:33,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {48223#true} call ULTIMATE.init(); {48270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:33,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {48270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {48223#true} is VALID [2022-04-15 12:19:33,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 12:19:33,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 12:19:33,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {48223#true} call #t~ret5 := main(); {48223#true} is VALID [2022-04-15 12:19:33,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {48223#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48228#(= main_~i~0 0)} is VALID [2022-04-15 12:19:33,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {48228#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48228#(= main_~i~0 0)} is VALID [2022-04-15 12:19:33,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {48228#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:33,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {48229#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:33,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {48229#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:33,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {48230#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:33,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {48230#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48231#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:33,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {48231#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48231#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:33,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {48231#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48232#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:33,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {48232#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48232#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:33,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {48232#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48233#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:33,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {48233#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48233#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:33,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {48233#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48234#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:33,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {48234#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48234#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:33,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {48234#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48235#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:33,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {48235#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48235#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:33,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {48235#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48236#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:33,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {48236#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48236#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:33,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {48236#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48237#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:33,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {48237#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48237#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:33,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {48237#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48238#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:33,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {48238#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48238#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:33,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {48238#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48239#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:33,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {48239#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48239#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:33,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {48239#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48240#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:33,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {48240#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48240#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:33,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {48240#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48241#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:33,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {48241#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48241#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:33,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {48241#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48242#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:33,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {48242#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48242#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:33,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {48242#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48243#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:33,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {48243#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48243#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:33,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {48243#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48244#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:33,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {48244#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48244#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:33,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {48244#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48245#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:33,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {48245#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48245#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:33,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {48245#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48246#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:33,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {48246#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48246#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:33,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {48246#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48247#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:33,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {48247#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48247#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:33,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {48247#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48248#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:33,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {48248#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48248#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:33,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {48248#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48249#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:33,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {48249#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48249#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:33,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {48249#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48250#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:33,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {48250#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48250#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:33,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {48250#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48251#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:33,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {48251#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48251#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:33,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {48251#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48252#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:33,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {48252#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48252#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:33,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {48252#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48253#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:33,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {48253#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48253#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:33,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {48253#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48254#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:33,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {48254#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48254#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:33,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {48254#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48255#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:33,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {48255#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48255#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:33,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {48255#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48256#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:33,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {48256#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48256#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:33,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {48256#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48257#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:33,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {48257#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48257#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:33,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {48257#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48258#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:33,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {48258#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48258#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:33,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {48258#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48259#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:33,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {48259#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48259#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:33,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {48259#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48260#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:33,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {48260#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48260#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:33,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {48260#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48261#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:33,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {48261#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48261#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:33,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {48261#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48262#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:33,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {48262#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48262#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:33,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {48262#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48263#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:33,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {48263#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48263#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:33,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {48263#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48264#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:33,204 INFO L290 TraceCheckUtils]: 78: Hoare triple {48264#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48264#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:33,204 INFO L290 TraceCheckUtils]: 79: Hoare triple {48264#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48265#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:33,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {48265#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48265#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:33,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {48265#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48266#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:33,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {48266#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48266#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:33,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {48266#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48267#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:33,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {48267#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48267#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:33,206 INFO L290 TraceCheckUtils]: 85: Hoare triple {48267#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48268#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:33,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {48268#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48268#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:33,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {48268#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48269#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 88: Hoare triple {48269#(<= main_~i~0 41)} assume !(~i~0 < 1023); {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 89: Hoare triple {48224#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 90: Hoare triple {48224#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 91: Hoare triple {48224#false} assume !!(0 != #t~mem4);havoc #t~mem4; {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 92: Hoare triple {48224#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 93: Hoare triple {48224#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 94: Hoare triple {48224#false} assume !!(0 != #t~mem4);havoc #t~mem4; {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 95: Hoare triple {48224#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 96: Hoare triple {48224#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L290 TraceCheckUtils]: 97: Hoare triple {48224#false} assume !(0 != #t~mem4);havoc #t~mem4; {48224#false} is VALID [2022-04-15 12:19:33,208 INFO L272 TraceCheckUtils]: 98: Hoare triple {48224#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {48224#false} is VALID [2022-04-15 12:19:33,209 INFO L290 TraceCheckUtils]: 99: Hoare triple {48224#false} ~cond := #in~cond; {48224#false} is VALID [2022-04-15 12:19:33,209 INFO L290 TraceCheckUtils]: 100: Hoare triple {48224#false} assume 0 == ~cond; {48224#false} is VALID [2022-04-15 12:19:33,209 INFO L290 TraceCheckUtils]: 101: Hoare triple {48224#false} assume !false; {48224#false} is VALID [2022-04-15 12:19:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:33,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119225076] [2022-04-15 12:19:33,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119225076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:33,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185875089] [2022-04-15 12:19:33,210 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:33,211 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-15 12:19:33,213 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-15 12:19:33,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:19:33,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:33,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:19:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:33,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {48223#true} call ULTIMATE.init(); {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {48223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {48223#true} call #t~ret5 := main(); {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {48223#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 55: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 56: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 73: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 74: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 75: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 76: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 78: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 79: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 80: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 81: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 82: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 83: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 84: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 85: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 86: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 87: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:33,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {48223#true} assume !(~i~0 < 1023); {48223#true} is VALID [2022-04-15 12:19:33,839 INFO L290 TraceCheckUtils]: 89: Hoare triple {48223#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {48541#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:33,839 INFO L290 TraceCheckUtils]: 90: Hoare triple {48541#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48541#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:33,840 INFO L290 TraceCheckUtils]: 91: Hoare triple {48541#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {48541#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:33,840 INFO L290 TraceCheckUtils]: 92: Hoare triple {48541#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:33,840 INFO L290 TraceCheckUtils]: 93: Hoare triple {48229#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48229#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:33,841 INFO L290 TraceCheckUtils]: 94: Hoare triple {48229#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:33,841 INFO L290 TraceCheckUtils]: 95: Hoare triple {48229#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:33,842 INFO L290 TraceCheckUtils]: 96: Hoare triple {48230#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48230#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:33,842 INFO L290 TraceCheckUtils]: 97: Hoare triple {48230#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:33,842 INFO L272 TraceCheckUtils]: 98: Hoare triple {48230#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:33,843 INFO L290 TraceCheckUtils]: 99: Hoare triple {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:33,843 INFO L290 TraceCheckUtils]: 100: Hoare triple {48573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48224#false} is VALID [2022-04-15 12:19:33,843 INFO L290 TraceCheckUtils]: 101: Hoare triple {48224#false} assume !false; {48224#false} is VALID [2022-04-15 12:19:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 12:19:33,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:34,226 INFO L290 TraceCheckUtils]: 101: Hoare triple {48224#false} assume !false; {48224#false} is VALID [2022-04-15 12:19:34,226 INFO L290 TraceCheckUtils]: 100: Hoare triple {48573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48224#false} is VALID [2022-04-15 12:19:34,227 INFO L290 TraceCheckUtils]: 99: Hoare triple {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:34,227 INFO L272 TraceCheckUtils]: 98: Hoare triple {48589#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:34,227 INFO L290 TraceCheckUtils]: 97: Hoare triple {48589#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {48589#(<= main_~i~0 1024)} is VALID [2022-04-15 12:19:34,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {48589#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48589#(<= main_~i~0 1024)} is VALID [2022-04-15 12:19:34,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {48599#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48589#(<= main_~i~0 1024)} is VALID [2022-04-15 12:19:34,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {48599#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {48599#(<= main_~i~0 1023)} is VALID [2022-04-15 12:19:34,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {48599#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48599#(<= main_~i~0 1023)} is VALID [2022-04-15 12:19:34,229 INFO L290 TraceCheckUtils]: 92: Hoare triple {48609#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48599#(<= main_~i~0 1023)} is VALID [2022-04-15 12:19:34,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {48609#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {48609#(<= main_~i~0 1022)} is VALID [2022-04-15 12:19:34,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {48609#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48609#(<= main_~i~0 1022)} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 89: Hoare triple {48223#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {48609#(<= main_~i~0 1022)} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 88: Hoare triple {48223#true} assume !(~i~0 < 1023); {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 87: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 86: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,230 INFO L290 TraceCheckUtils]: 80: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 77: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 76: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 75: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 74: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {48223#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48223#true} is VALID [2022-04-15 12:19:34,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {48223#true} call #t~ret5 := main(); {48223#true} is VALID [2022-04-15 12:19:34,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 12:19:34,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 12:19:34,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {48223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {48223#true} is VALID [2022-04-15 12:19:34,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {48223#true} call ULTIMATE.init(); {48223#true} is VALID [2022-04-15 12:19:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 12:19:34,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185875089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:34,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:34,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 7] total 51 [2022-04-15 12:19:34,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:34,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358171711] [2022-04-15 12:19:34,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358171711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:34,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:34,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 12:19:34,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179622401] [2022-04-15 12:19:34,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 12:19:34,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:34,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:34,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:34,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 12:19:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:34,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 12:19:34,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=1416, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:19:34,300 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:40,153 INFO L93 Difference]: Finished difference Result 281 states and 323 transitions. [2022-04-15 12:19:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 12:19:40,153 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 12:19:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 318 transitions. [2022-04-15 12:19:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 318 transitions. [2022-04-15 12:19:40,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 318 transitions. [2022-04-15 12:19:40,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:40,392 INFO L225 Difference]: With dead ends: 281 [2022-04-15 12:19:40,392 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 12:19:40,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3151, Invalid=5405, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 12:19:40,393 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 584 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:40,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 46 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:19:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 12:19:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 105. [2022-04-15 12:19:40,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:40,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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-15 12:19:40,879 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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-15 12:19:40,879 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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-15 12:19:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:40,882 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2022-04-15 12:19:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2022-04-15 12:19:40,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:40,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:40,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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 267 states. [2022-04-15 12:19:40,883 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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 267 states. [2022-04-15 12:19:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:40,885 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2022-04-15 12:19:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2022-04-15 12:19:40,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:40,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:40,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:40,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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-15 12:19:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-04-15 12:19:40,887 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2022-04-15 12:19:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:40,887 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-04-15 12:19:40,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 106 transitions. [2022-04-15 12:19:41,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-15 12:19:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 12:19:41,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:41,073 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:41,090 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-15 12:19:41,274 WARN L460 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-15 12:19:41,274 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2100890045, now seen corresponding path program 85 times [2022-04-15 12:19:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:41,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [423950529] [2022-04-15 12:19:41,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:41,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2100890045, now seen corresponding path program 86 times [2022-04-15 12:19:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507353239] [2022-04-15 12:19:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:42,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {50326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {50278#true} is VALID [2022-04-15 12:19:42,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 12:19:42,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 12:19:42,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {50278#true} call ULTIMATE.init(); {50326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:42,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {50326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {50278#true} is VALID [2022-04-15 12:19:42,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 12:19:42,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 12:19:42,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {50278#true} call #t~ret5 := main(); {50278#true} is VALID [2022-04-15 12:19:42,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {50278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50283#(= main_~i~0 0)} is VALID [2022-04-15 12:19:42,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {50283#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50283#(= main_~i~0 0)} is VALID [2022-04-15 12:19:42,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {50283#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:42,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {50284#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:42,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {50284#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:42,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {50285#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:42,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {50285#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:42,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {50286#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:42,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {50286#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:42,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {50287#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:42,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {50287#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:42,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {50288#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:42,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {50288#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:42,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {50289#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:42,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {50289#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:42,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {50290#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:42,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {50290#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:42,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {50291#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:42,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {50291#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:42,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {50292#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:42,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {50292#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:42,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {50293#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:42,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {50293#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:42,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {50294#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:42,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {50294#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:42,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {50295#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:42,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {50295#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:42,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {50296#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:42,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {50296#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:42,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {50297#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:42,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {50297#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:42,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {50298#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:42,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {50298#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:42,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {50299#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:42,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {50299#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:42,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {50300#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:42,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {50300#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:42,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {50301#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:42,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {50301#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:42,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {50302#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:42,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {50302#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:42,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {50303#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:42,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {50303#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:42,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {50304#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:42,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {50304#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:42,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {50305#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:42,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {50305#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:42,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {50306#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:42,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {50306#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:42,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {50307#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:42,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {50307#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:42,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {50308#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:42,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {50308#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:42,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {50309#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:42,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {50309#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:42,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {50310#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:42,104 INFO L290 TraceCheckUtils]: 61: Hoare triple {50310#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:42,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {50311#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:42,105 INFO L290 TraceCheckUtils]: 63: Hoare triple {50311#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:42,105 INFO L290 TraceCheckUtils]: 64: Hoare triple {50312#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:42,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {50312#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:42,106 INFO L290 TraceCheckUtils]: 66: Hoare triple {50313#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:42,106 INFO L290 TraceCheckUtils]: 67: Hoare triple {50313#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:42,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {50314#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:42,107 INFO L290 TraceCheckUtils]: 69: Hoare triple {50314#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:42,107 INFO L290 TraceCheckUtils]: 70: Hoare triple {50315#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:42,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {50315#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:42,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {50316#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:42,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {50316#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:42,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {50317#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:42,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {50317#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:42,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {50318#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:42,110 INFO L290 TraceCheckUtils]: 77: Hoare triple {50318#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:42,110 INFO L290 TraceCheckUtils]: 78: Hoare triple {50319#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:42,110 INFO L290 TraceCheckUtils]: 79: Hoare triple {50319#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:42,111 INFO L290 TraceCheckUtils]: 80: Hoare triple {50320#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:42,111 INFO L290 TraceCheckUtils]: 81: Hoare triple {50320#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:42,111 INFO L290 TraceCheckUtils]: 82: Hoare triple {50321#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:42,112 INFO L290 TraceCheckUtils]: 83: Hoare triple {50321#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:42,112 INFO L290 TraceCheckUtils]: 84: Hoare triple {50322#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:42,112 INFO L290 TraceCheckUtils]: 85: Hoare triple {50322#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:42,112 INFO L290 TraceCheckUtils]: 86: Hoare triple {50323#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:42,113 INFO L290 TraceCheckUtils]: 87: Hoare triple {50323#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:42,113 INFO L290 TraceCheckUtils]: 88: Hoare triple {50324#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:42,113 INFO L290 TraceCheckUtils]: 89: Hoare triple {50324#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50325#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 90: Hoare triple {50325#(<= main_~i~0 42)} assume !(~i~0 < 1023); {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 91: Hoare triple {50279#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 92: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 93: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 94: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 95: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L290 TraceCheckUtils]: 99: Hoare triple {50279#false} assume !(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:42,114 INFO L272 TraceCheckUtils]: 100: Hoare triple {50279#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {50279#false} is VALID [2022-04-15 12:19:42,115 INFO L290 TraceCheckUtils]: 101: Hoare triple {50279#false} ~cond := #in~cond; {50279#false} is VALID [2022-04-15 12:19:42,115 INFO L290 TraceCheckUtils]: 102: Hoare triple {50279#false} assume 0 == ~cond; {50279#false} is VALID [2022-04-15 12:19:42,115 INFO L290 TraceCheckUtils]: 103: Hoare triple {50279#false} assume !false; {50279#false} is VALID [2022-04-15 12:19:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:42,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507353239] [2022-04-15 12:19:42,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507353239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:42,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721312449] [2022-04-15 12:19:42,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:42,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:42,117 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-15 12:19:42,117 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-15 12:19:42,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:42,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:42,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:19:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:42,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:42,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {50278#true} call ULTIMATE.init(); {50278#true} is VALID [2022-04-15 12:19:42,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {50278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {50278#true} is VALID [2022-04-15 12:19:42,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 12:19:42,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 12:19:42,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {50278#true} call #t~ret5 := main(); {50278#true} is VALID [2022-04-15 12:19:42,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {50278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50345#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:42,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {50345#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50345#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:43,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {50345#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:43,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {50284#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:43,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {50284#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:43,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {50285#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:43,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {50285#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:43,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {50286#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:43,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {50286#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:43,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {50287#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:43,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {50287#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:43,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {50288#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:43,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {50288#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:43,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {50289#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:43,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {50289#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:43,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {50290#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:43,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {50290#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:43,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {50291#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:43,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {50291#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:43,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {50292#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:43,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {50292#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:43,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {50293#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:43,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {50293#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:43,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {50294#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:43,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {50294#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:43,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {50295#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:43,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {50295#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:43,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {50296#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:43,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {50296#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:43,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {50297#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:43,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {50297#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:43,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {50298#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:43,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {50298#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:43,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {50299#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:43,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {50299#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:43,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {50300#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:43,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {50300#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:43,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {50301#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:43,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {50301#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:43,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {50302#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:43,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {50302#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:43,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {50303#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:43,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {50303#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:43,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {50304#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:43,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {50304#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:43,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {50305#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:43,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {50305#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:43,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {50306#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:43,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {50306#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:43,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {50307#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:43,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {50307#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:43,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {50308#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:43,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {50308#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:43,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {50309#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:43,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {50309#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:43,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {50310#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:43,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {50310#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:43,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {50311#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:43,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {50311#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:43,032 INFO L290 TraceCheckUtils]: 64: Hoare triple {50312#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:43,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {50312#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:43,033 INFO L290 TraceCheckUtils]: 66: Hoare triple {50313#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:43,034 INFO L290 TraceCheckUtils]: 67: Hoare triple {50313#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:43,034 INFO L290 TraceCheckUtils]: 68: Hoare triple {50314#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:43,034 INFO L290 TraceCheckUtils]: 69: Hoare triple {50314#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:43,034 INFO L290 TraceCheckUtils]: 70: Hoare triple {50315#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:43,035 INFO L290 TraceCheckUtils]: 71: Hoare triple {50315#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:43,035 INFO L290 TraceCheckUtils]: 72: Hoare triple {50316#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:43,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {50316#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:43,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {50317#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:43,036 INFO L290 TraceCheckUtils]: 75: Hoare triple {50317#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:43,036 INFO L290 TraceCheckUtils]: 76: Hoare triple {50318#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:43,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {50318#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:43,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {50319#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:43,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {50319#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:43,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {50320#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:43,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {50320#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:43,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {50321#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:43,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {50321#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:43,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {50322#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:43,039 INFO L290 TraceCheckUtils]: 85: Hoare triple {50322#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:43,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {50323#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:43,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {50323#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:43,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {50324#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {50324#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50325#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {50325#(<= main_~i~0 42)} assume !(~i~0 < 1023); {50279#false} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {50279#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {50279#false} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:43,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L290 TraceCheckUtils]: 99: Hoare triple {50279#false} assume !(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L272 TraceCheckUtils]: 100: Hoare triple {50279#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L290 TraceCheckUtils]: 101: Hoare triple {50279#false} ~cond := #in~cond; {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L290 TraceCheckUtils]: 102: Hoare triple {50279#false} assume 0 == ~cond; {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L290 TraceCheckUtils]: 103: Hoare triple {50279#false} assume !false; {50279#false} is VALID [2022-04-15 12:19:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:43,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:45,973 INFO L290 TraceCheckUtils]: 103: Hoare triple {50279#false} assume !false; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {50279#false} assume 0 == ~cond; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 101: Hoare triple {50279#false} ~cond := #in~cond; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L272 TraceCheckUtils]: 100: Hoare triple {50279#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 99: Hoare triple {50279#false} assume !(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 98: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 97: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 96: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 95: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 94: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 93: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 92: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 12:19:45,974 INFO L290 TraceCheckUtils]: 91: Hoare triple {50279#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {50279#false} is VALID [2022-04-15 12:19:45,975 INFO L290 TraceCheckUtils]: 90: Hoare triple {50679#(< main_~i~0 1023)} assume !(~i~0 < 1023); {50279#false} is VALID [2022-04-15 12:19:45,979 INFO L290 TraceCheckUtils]: 89: Hoare triple {50683#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50679#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:45,980 INFO L290 TraceCheckUtils]: 88: Hoare triple {50683#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50683#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:45,980 INFO L290 TraceCheckUtils]: 87: Hoare triple {50690#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50683#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:45,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {50690#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50690#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:45,981 INFO L290 TraceCheckUtils]: 85: Hoare triple {50697#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50690#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:45,981 INFO L290 TraceCheckUtils]: 84: Hoare triple {50697#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50697#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:45,999 INFO L290 TraceCheckUtils]: 83: Hoare triple {50704#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50697#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:46,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {50704#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50704#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:46,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {50711#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50704#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:46,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {50711#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50711#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:46,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {50718#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50711#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:46,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {50718#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50718#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:46,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {50725#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50718#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:46,003 INFO L290 TraceCheckUtils]: 76: Hoare triple {50725#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50725#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:46,003 INFO L290 TraceCheckUtils]: 75: Hoare triple {50732#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50725#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:46,003 INFO L290 TraceCheckUtils]: 74: Hoare triple {50732#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50732#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:46,004 INFO L290 TraceCheckUtils]: 73: Hoare triple {50739#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50732#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:46,004 INFO L290 TraceCheckUtils]: 72: Hoare triple {50739#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50739#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:46,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {50746#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50739#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:46,005 INFO L290 TraceCheckUtils]: 70: Hoare triple {50746#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50746#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:46,005 INFO L290 TraceCheckUtils]: 69: Hoare triple {50753#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50746#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:46,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {50753#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50753#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:46,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {50760#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50753#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:46,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {50760#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50760#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:46,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {50767#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50760#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:46,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {50767#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50767#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:46,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {50774#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50767#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:46,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {50774#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50774#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:46,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {50781#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50774#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:46,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {50781#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50781#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:46,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {50788#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50781#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:46,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {50788#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50788#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:46,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {50795#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50788#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:46,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {50795#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50795#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:46,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {50802#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50795#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:46,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {50802#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50802#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:46,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {50809#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50802#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:46,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {50809#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50809#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:46,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {50816#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50809#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:46,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {50816#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50816#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:46,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {50823#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50816#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:46,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {50823#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50823#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:46,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {50830#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50823#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:46,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {50830#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50830#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:46,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {50837#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50830#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:46,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {50837#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -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 1000)} is VALID [2022-04-15 12:19:46,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {50844#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50837#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:46,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {50844#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -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 999)} is VALID [2022-04-15 12:19:46,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {50851#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(< main_~i~0 999)} is VALID [2022-04-15 12:19:46,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {50851#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -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 998)} is VALID [2022-04-15 12:19:46,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {50858#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(< main_~i~0 998)} is VALID [2022-04-15 12:19:46,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {50858#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -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 997)} is VALID [2022-04-15 12:19:46,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {50865#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(< main_~i~0 997)} is VALID [2022-04-15 12:19:46,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {50865#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -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 996)} is VALID [2022-04-15 12:19:46,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {50872#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(< main_~i~0 996)} is VALID [2022-04-15 12:19:46,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {50872#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -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 995)} is VALID [2022-04-15 12:19:46,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {50879#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(< main_~i~0 995)} is VALID [2022-04-15 12:19:46,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {50879#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50879#(< main_~i~0 994)} is VALID [2022-04-15 12:19:46,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {50886#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50879#(< main_~i~0 994)} is VALID [2022-04-15 12:19:46,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {50886#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50886#(< main_~i~0 993)} is VALID [2022-04-15 12:19:46,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {50893#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50886#(< main_~i~0 993)} is VALID [2022-04-15 12:19:46,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {50893#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50893#(< main_~i~0 992)} is VALID [2022-04-15 12:19:46,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {50900#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50893#(< main_~i~0 992)} is VALID [2022-04-15 12:19:46,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {50900#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50900#(< main_~i~0 991)} is VALID [2022-04-15 12:19:46,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {50907#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50900#(< main_~i~0 991)} is VALID [2022-04-15 12:19:46,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {50907#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50907#(< main_~i~0 990)} is VALID [2022-04-15 12:19:46,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {50914#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50907#(< main_~i~0 990)} is VALID [2022-04-15 12:19:46,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {50914#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50914#(< main_~i~0 989)} is VALID [2022-04-15 12:19:46,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {50921#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50914#(< main_~i~0 989)} is VALID [2022-04-15 12:19:46,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {50921#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50921#(< main_~i~0 988)} is VALID [2022-04-15 12:19:46,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {50928#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50921#(< main_~i~0 988)} is VALID [2022-04-15 12:19:46,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {50928#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50928#(< main_~i~0 987)} is VALID [2022-04-15 12:19:46,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {50935#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50928#(< main_~i~0 987)} is VALID [2022-04-15 12:19:46,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {50935#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50935#(< main_~i~0 986)} is VALID [2022-04-15 12:19:46,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {50942#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50935#(< main_~i~0 986)} is VALID [2022-04-15 12:19:46,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {50942#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50942#(< main_~i~0 985)} is VALID [2022-04-15 12:19:46,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {50949#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50942#(< main_~i~0 985)} is VALID [2022-04-15 12:19:46,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {50949#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50949#(< main_~i~0 984)} is VALID [2022-04-15 12:19:46,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {50956#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50949#(< main_~i~0 984)} is VALID [2022-04-15 12:19:46,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {50956#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50956#(< main_~i~0 983)} is VALID [2022-04-15 12:19:46,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {50963#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50956#(< main_~i~0 983)} is VALID [2022-04-15 12:19:46,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {50963#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50963#(< main_~i~0 982)} is VALID [2022-04-15 12:19:46,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {50970#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50963#(< main_~i~0 982)} is VALID [2022-04-15 12:19:46,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {50970#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50970#(< main_~i~0 981)} is VALID [2022-04-15 12:19:46,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {50278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50970#(< main_~i~0 981)} is VALID [2022-04-15 12:19:46,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {50278#true} call #t~ret5 := main(); {50278#true} is VALID [2022-04-15 12:19:46,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 12:19:46,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 12:19:46,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {50278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {50278#true} is VALID [2022-04-15 12:19:46,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {50278#true} call ULTIMATE.init(); {50278#true} is VALID [2022-04-15 12:19:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:46,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721312449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:46,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:46,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-15 12:19:46,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:46,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [423950529] [2022-04-15 12:19:46,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [423950529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:46,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:46,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 12:19:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475274119] [2022-04-15 12:19:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-15 12:19:46,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:46,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:46,147 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-15 12:19:46,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 12:19:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 12:19:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 12:19:46,149 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:53,621 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-04-15 12:19:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 12:19:53,621 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-15 12:19:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 325 transitions. [2022-04-15 12:19:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 325 transitions. [2022-04-15 12:19:53,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 325 transitions. [2022-04-15 12:19:53,862 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-15 12:19:53,866 INFO L225 Difference]: With dead ends: 287 [2022-04-15 12:19:53,866 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 12:19:53,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 12:19:53,868 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 593 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:53,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 41 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:19:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 12:19:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 107. [2022-04-15 12:19:54,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:54,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 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-15 12:19:54,402 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 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-15 12:19:54,403 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 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-15 12:19:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:54,407 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2022-04-15 12:19:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-04-15 12:19:54,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:54,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:54,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 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 273 states. [2022-04-15 12:19:54,408 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 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 273 states. [2022-04-15 12:19:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:54,412 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2022-04-15 12:19:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-04-15 12:19:54,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:54,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:54,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:54,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 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-15 12:19:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-15 12:19:54,414 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2022-04-15 12:19:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:54,415 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-15 12:19:54,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:54,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-15 12:19:54,660 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-15 12:19:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 12:19:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 12:19:54,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:54,660 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:54,687 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-15 12:19:54,879 WARN L460 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-15 12:19:54,880 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2083049371, now seen corresponding path program 87 times [2022-04-15 12:19:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:54,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793368000] [2022-04-15 12:19:54,886 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:54,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2083049371, now seen corresponding path program 88 times [2022-04-15 12:19:54,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:54,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379793375] [2022-04-15 12:19:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:55,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {52463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {52414#true} is VALID [2022-04-15 12:19:55,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 12:19:55,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 12:19:55,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {52414#true} call ULTIMATE.init(); {52463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:55,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {52463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {52414#true} is VALID [2022-04-15 12:19:55,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 12:19:55,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 12:19:55,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {52414#true} call #t~ret5 := main(); {52414#true} is VALID [2022-04-15 12:19:55,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {52414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {52419#(= main_~i~0 0)} is VALID [2022-04-15 12:19:55,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {52419#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52419#(= main_~i~0 0)} is VALID [2022-04-15 12:19:55,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {52419#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:55,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {52420#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:55,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {52420#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:55,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {52421#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:55,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {52421#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:55,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {52422#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:55,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {52422#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:55,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {52423#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:55,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {52423#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:55,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {52424#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:55,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {52424#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:55,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {52425#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:55,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {52425#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:55,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {52426#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:55,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {52426#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:55,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {52427#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:55,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {52427#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:55,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {52428#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:55,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {52428#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:55,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {52429#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:55,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {52429#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:55,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {52430#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:55,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {52430#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:55,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {52431#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:55,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {52431#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:55,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {52432#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:55,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {52432#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:55,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {52433#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:55,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {52433#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:55,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {52434#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:55,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {52434#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:55,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {52435#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:55,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {52435#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:55,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {52436#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:55,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {52436#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:55,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {52437#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:55,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {52437#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:55,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {52438#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:55,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {52438#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:55,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {52439#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:55,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {52439#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:55,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {52440#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:55,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {52440#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:55,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {52441#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:55,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {52441#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:55,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {52442#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:55,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {52442#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:55,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {52443#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:55,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {52443#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:55,831 INFO L290 TraceCheckUtils]: 56: Hoare triple {52444#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:55,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {52444#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:55,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {52445#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:55,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {52445#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:55,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {52446#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:55,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {52446#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:55,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {52447#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:55,833 INFO L290 TraceCheckUtils]: 63: Hoare triple {52447#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:55,834 INFO L290 TraceCheckUtils]: 64: Hoare triple {52448#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:55,834 INFO L290 TraceCheckUtils]: 65: Hoare triple {52448#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:55,834 INFO L290 TraceCheckUtils]: 66: Hoare triple {52449#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:55,835 INFO L290 TraceCheckUtils]: 67: Hoare triple {52449#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:55,835 INFO L290 TraceCheckUtils]: 68: Hoare triple {52450#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:55,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {52450#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:55,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {52451#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:55,836 INFO L290 TraceCheckUtils]: 71: Hoare triple {52451#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:55,836 INFO L290 TraceCheckUtils]: 72: Hoare triple {52452#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:55,837 INFO L290 TraceCheckUtils]: 73: Hoare triple {52452#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:55,837 INFO L290 TraceCheckUtils]: 74: Hoare triple {52453#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:55,837 INFO L290 TraceCheckUtils]: 75: Hoare triple {52453#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:55,837 INFO L290 TraceCheckUtils]: 76: Hoare triple {52454#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:55,838 INFO L290 TraceCheckUtils]: 77: Hoare triple {52454#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:55,838 INFO L290 TraceCheckUtils]: 78: Hoare triple {52455#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:55,838 INFO L290 TraceCheckUtils]: 79: Hoare triple {52455#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:55,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {52456#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:55,839 INFO L290 TraceCheckUtils]: 81: Hoare triple {52456#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:55,839 INFO L290 TraceCheckUtils]: 82: Hoare triple {52457#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:55,840 INFO L290 TraceCheckUtils]: 83: Hoare triple {52457#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:55,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {52458#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:55,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {52458#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:55,841 INFO L290 TraceCheckUtils]: 86: Hoare triple {52459#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:55,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {52459#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:55,841 INFO L290 TraceCheckUtils]: 88: Hoare triple {52460#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:55,842 INFO L290 TraceCheckUtils]: 89: Hoare triple {52460#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:55,842 INFO L290 TraceCheckUtils]: 90: Hoare triple {52461#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:55,842 INFO L290 TraceCheckUtils]: 91: Hoare triple {52461#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52462#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 92: Hoare triple {52462#(<= main_~i~0 43)} assume !(~i~0 < 1023); {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {52415#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 94: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 97: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 99: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 100: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 101: Hoare triple {52415#false} assume !(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L272 TraceCheckUtils]: 102: Hoare triple {52415#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {52415#false} ~cond := #in~cond; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 104: Hoare triple {52415#false} assume 0 == ~cond; {52415#false} is VALID [2022-04-15 12:19:55,843 INFO L290 TraceCheckUtils]: 105: Hoare triple {52415#false} assume !false; {52415#false} is VALID [2022-04-15 12:19:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:55,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:55,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379793375] [2022-04-15 12:19:55,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379793375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:55,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017158511] [2022-04-15 12:19:55,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:55,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:55,845 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-15 12:19:55,846 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-15 12:19:56,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:56,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:56,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 12:19:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:56,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:56,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {52414#true} call ULTIMATE.init(); {52414#true} is VALID [2022-04-15 12:19:56,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {52414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {52414#true} is VALID [2022-04-15 12:19:56,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 12:19:56,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 12:19:56,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {52414#true} call #t~ret5 := main(); {52414#true} is VALID [2022-04-15 12:19:56,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {52414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {52482#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:56,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {52482#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52482#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:56,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {52482#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:56,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {52420#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:56,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {52420#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:56,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {52421#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:56,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {52421#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:56,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {52422#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:56,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {52422#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:56,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {52423#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:56,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {52423#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:56,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {52424#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:56,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {52424#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:56,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {52425#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:56,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {52425#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:56,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {52426#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:56,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {52426#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:56,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {52427#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:56,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {52427#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:56,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {52428#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:56,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {52428#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:56,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {52429#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:56,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {52429#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:56,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {52430#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:56,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {52430#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:56,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {52431#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:56,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {52431#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:56,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {52432#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:56,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {52432#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:56,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {52433#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:56,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {52433#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:56,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {52434#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:56,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {52434#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:56,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {52435#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:56,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {52435#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:56,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {52436#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:56,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {52436#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:56,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {52437#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:56,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {52437#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:56,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {52438#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:56,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {52438#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:56,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {52439#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:56,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {52439#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:56,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {52440#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:56,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {52440#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:56,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {52441#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:56,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {52441#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:56,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {52442#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:56,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {52442#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:56,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {52443#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:56,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {52443#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:56,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {52444#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:56,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {52444#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:56,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {52445#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:56,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {52445#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:56,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {52446#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:56,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {52446#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:56,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {52447#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:56,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {52447#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:56,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {52448#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:56,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {52448#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:56,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {52449#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:56,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {52449#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:56,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {52450#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:56,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {52450#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:56,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {52451#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:56,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {52451#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:56,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {52452#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:56,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {52452#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:56,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {52453#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:56,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {52453#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:56,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {52454#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:56,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {52454#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:56,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {52455#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:56,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {52455#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:56,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {52456#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:56,729 INFO L290 TraceCheckUtils]: 81: Hoare triple {52456#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:56,730 INFO L290 TraceCheckUtils]: 82: Hoare triple {52457#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:56,730 INFO L290 TraceCheckUtils]: 83: Hoare triple {52457#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:56,730 INFO L290 TraceCheckUtils]: 84: Hoare triple {52458#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:56,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {52458#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:56,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {52459#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:56,731 INFO L290 TraceCheckUtils]: 87: Hoare triple {52459#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:56,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {52460#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:56,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {52460#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:56,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {52461#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 91: Hoare triple {52461#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52462#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 92: Hoare triple {52462#(<= main_~i~0 43)} assume !(~i~0 < 1023); {52415#false} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 93: Hoare triple {52415#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {52415#false} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 97: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:56,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L290 TraceCheckUtils]: 99: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L290 TraceCheckUtils]: 100: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L290 TraceCheckUtils]: 101: Hoare triple {52415#false} assume !(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L272 TraceCheckUtils]: 102: Hoare triple {52415#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L290 TraceCheckUtils]: 103: Hoare triple {52415#false} ~cond := #in~cond; {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L290 TraceCheckUtils]: 104: Hoare triple {52415#false} assume 0 == ~cond; {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L290 TraceCheckUtils]: 105: Hoare triple {52415#false} assume !false; {52415#false} is VALID [2022-04-15 12:19:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:56,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {52415#false} assume !false; {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {52415#false} assume 0 == ~cond; {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 103: Hoare triple {52415#false} ~cond := #in~cond; {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L272 TraceCheckUtils]: 102: Hoare triple {52415#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 101: Hoare triple {52415#false} assume !(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 100: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 99: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 12:19:59,093 INFO L290 TraceCheckUtils]: 98: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 95: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 94: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 93: Hoare triple {52415#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 92: Hoare triple {52822#(< main_~i~0 1023)} assume !(~i~0 < 1023); {52415#false} is VALID [2022-04-15 12:19:59,094 INFO L290 TraceCheckUtils]: 91: Hoare triple {52826#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52822#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:59,095 INFO L290 TraceCheckUtils]: 90: Hoare triple {52826#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52826#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:59,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {52833#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52826#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:59,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {52833#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52833#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:59,096 INFO L290 TraceCheckUtils]: 87: Hoare triple {52840#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52833#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:59,096 INFO L290 TraceCheckUtils]: 86: Hoare triple {52840#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52840#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:59,096 INFO L290 TraceCheckUtils]: 85: Hoare triple {52847#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52840#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:59,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {52847#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52847#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:59,097 INFO L290 TraceCheckUtils]: 83: Hoare triple {52854#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52847#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:59,097 INFO L290 TraceCheckUtils]: 82: Hoare triple {52854#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52854#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:59,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {52861#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52854#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:59,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {52861#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52861#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:59,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {52868#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52861#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:59,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {52868#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52868#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:59,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {52875#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52868#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:59,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {52875#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52875#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:59,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {52882#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52875#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:59,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {52882#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52882#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:59,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {52889#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52882#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:59,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {52889#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52889#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:59,101 INFO L290 TraceCheckUtils]: 71: Hoare triple {52896#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52889#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:59,101 INFO L290 TraceCheckUtils]: 70: Hoare triple {52896#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52896#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:59,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {52903#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52896#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:59,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {52903#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52903#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:59,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {52910#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52903#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:59,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {52910#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52910#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:59,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {52917#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52910#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:59,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {52917#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52917#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:59,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {52924#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52917#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:59,104 INFO L290 TraceCheckUtils]: 62: Hoare triple {52924#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52924#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:59,104 INFO L290 TraceCheckUtils]: 61: Hoare triple {52931#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52924#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:59,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {52931#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52931#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:59,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {52938#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52931#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:59,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {52938#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52938#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:59,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {52945#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52938#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:59,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {52945#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52945#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:59,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {52952#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52945#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:59,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {52952#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52952#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:59,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {52959#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52952#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:59,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {52959#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52959#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:59,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {52966#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52959#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:59,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {52966#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52966#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:59,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {52973#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52966#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:59,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {52973#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52973#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:59,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {52980#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52973#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:59,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {52980#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52980#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:59,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {52987#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52980#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:59,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {52987#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52987#(< main_~i~0 999)} is VALID [2022-04-15 12:19:59,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {52994#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52987#(< main_~i~0 999)} is VALID [2022-04-15 12:19:59,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {52994#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52994#(< main_~i~0 998)} is VALID [2022-04-15 12:19:59,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {53001#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52994#(< main_~i~0 998)} is VALID [2022-04-15 12:19:59,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {53001#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53001#(< main_~i~0 997)} is VALID [2022-04-15 12:19:59,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {53008#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53001#(< main_~i~0 997)} is VALID [2022-04-15 12:19:59,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {53008#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53008#(< main_~i~0 996)} is VALID [2022-04-15 12:19:59,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {53015#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53008#(< main_~i~0 996)} is VALID [2022-04-15 12:19:59,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {53015#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53015#(< main_~i~0 995)} is VALID [2022-04-15 12:19:59,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {53022#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53015#(< main_~i~0 995)} is VALID [2022-04-15 12:19:59,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {53022#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53022#(< main_~i~0 994)} is VALID [2022-04-15 12:19:59,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {53029#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53022#(< main_~i~0 994)} is VALID [2022-04-15 12:19:59,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {53029#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53029#(< main_~i~0 993)} is VALID [2022-04-15 12:19:59,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {53036#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53029#(< main_~i~0 993)} is VALID [2022-04-15 12:19:59,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {53036#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53036#(< main_~i~0 992)} is VALID [2022-04-15 12:19:59,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {53043#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53036#(< main_~i~0 992)} is VALID [2022-04-15 12:19:59,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {53043#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53043#(< main_~i~0 991)} is VALID [2022-04-15 12:19:59,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {53050#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53043#(< main_~i~0 991)} is VALID [2022-04-15 12:19:59,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {53050#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53050#(< main_~i~0 990)} is VALID [2022-04-15 12:19:59,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {53057#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53050#(< main_~i~0 990)} is VALID [2022-04-15 12:19:59,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {53057#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53057#(< main_~i~0 989)} is VALID [2022-04-15 12:19:59,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {53064#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53057#(< main_~i~0 989)} is VALID [2022-04-15 12:19:59,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {53064#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53064#(< main_~i~0 988)} is VALID [2022-04-15 12:19:59,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {53071#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53064#(< main_~i~0 988)} is VALID [2022-04-15 12:19:59,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {53071#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53071#(< main_~i~0 987)} is VALID [2022-04-15 12:19:59,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53071#(< main_~i~0 987)} is VALID [2022-04-15 12:19:59,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -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#(< main_~i~0 986)} is VALID [2022-04-15 12:19:59,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {53085#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#(< main_~i~0 986)} is VALID [2022-04-15 12:19:59,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {53085#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -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 985)} is VALID [2022-04-15 12:19:59,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {53092#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53085#(< main_~i~0 985)} is VALID [2022-04-15 12:19:59,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {53092#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -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 984)} is VALID [2022-04-15 12:19:59,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {53099#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53092#(< main_~i~0 984)} is VALID [2022-04-15 12:19:59,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {53099#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -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 983)} is VALID [2022-04-15 12:19:59,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {53106#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53099#(< main_~i~0 983)} is VALID [2022-04-15 12:19:59,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {53106#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -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 982)} is VALID [2022-04-15 12:19:59,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {53113#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53106#(< main_~i~0 982)} is VALID [2022-04-15 12:19:59,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {53113#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -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 981)} is VALID [2022-04-15 12:19:59,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {53120#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53113#(< main_~i~0 981)} is VALID [2022-04-15 12:19:59,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {53120#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -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 980)} is VALID [2022-04-15 12:19:59,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {52414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53120#(< main_~i~0 980)} is VALID [2022-04-15 12:19:59,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {52414#true} call #t~ret5 := main(); {52414#true} is VALID [2022-04-15 12:19:59,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 12:19:59,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 12:19:59,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {52414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {52414#true} is VALID [2022-04-15 12:19:59,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {52414#true} call ULTIMATE.init(); {52414#true} is VALID [2022-04-15 12:19:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:19:59,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017158511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:59,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:59,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 12:19:59,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793368000] [2022-04-15 12:19:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793368000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:59,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:59,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 12:19:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751314341] [2022-04-15 12:19:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:59,124 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 12:19:59,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:59,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:59,188 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-15 12:19:59,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 12:19:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 12:19:59,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 12:19:59,189 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:06,968 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2022-04-15 12:20:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 12:20:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 12:20:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 332 transitions. [2022-04-15 12:20:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 332 transitions. [2022-04-15 12:20:06,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 332 transitions. [2022-04-15 12:20:08,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:08,057 INFO L225 Difference]: With dead ends: 293 [2022-04-15 12:20:08,057 INFO L226 Difference]: Without dead ends: 279 [2022-04-15 12:20:08,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 12:20:08,059 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 558 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:08,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 51 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-04-15 12:20:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 109. [2022-04-15 12:20:08,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:08,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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-15 12:20:08,821 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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-15 12:20:08,821 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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-15 12:20:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:08,825 INFO L93 Difference]: Finished difference Result 279 states and 322 transitions. [2022-04-15 12:20:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-04-15 12:20:08,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:08,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:08,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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 279 states. [2022-04-15 12:20:08,826 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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 279 states. [2022-04-15 12:20:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:08,839 INFO L93 Difference]: Finished difference Result 279 states and 322 transitions. [2022-04-15 12:20:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-04-15 12:20:08,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:08,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:08,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:08,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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-15 12:20:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-15 12:20:08,849 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2022-04-15 12:20:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:08,849 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-15 12:20:08,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:08,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-15 12:20:09,175 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-15 12:20:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:20:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 12:20:09,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:09,176 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:09,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-15 12:20:09,377 WARN L460 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-15 12:20:09,377 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2118030841, now seen corresponding path program 89 times [2022-04-15 12:20:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:09,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284412375] [2022-04-15 12:20:09,388 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:09,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2118030841, now seen corresponding path program 90 times [2022-04-15 12:20:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847398163] [2022-04-15 12:20:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:10,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {54644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {54594#true} is VALID [2022-04-15 12:20:10,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 12:20:10,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 12:20:10,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {54594#true} call ULTIMATE.init(); {54644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:10,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {54644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {54594#true} is VALID [2022-04-15 12:20:10,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 12:20:10,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 12:20:10,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {54594#true} call #t~ret5 := main(); {54594#true} is VALID [2022-04-15 12:20:10,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {54594#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {54599#(= main_~i~0 0)} is VALID [2022-04-15 12:20:10,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {54599#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54599#(= main_~i~0 0)} is VALID [2022-04-15 12:20:10,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {54599#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:10,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {54600#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:10,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {54600#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:10,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {54601#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:10,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {54601#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54602#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:10,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {54602#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54602#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:10,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {54602#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54603#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:10,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {54603#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54603#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:10,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {54603#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54604#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:10,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {54604#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54604#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:10,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {54604#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54605#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:10,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {54605#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54605#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:10,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {54605#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54606#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:10,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {54606#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54606#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:10,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {54606#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54607#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:10,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {54607#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54607#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:10,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {54607#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54608#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:10,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {54608#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54608#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:10,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {54608#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54609#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:10,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {54609#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54609#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:10,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {54609#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54610#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:10,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {54610#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54610#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:10,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {54610#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54611#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:10,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {54611#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54611#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:10,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {54611#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54612#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:10,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {54612#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54612#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:10,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {54612#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54613#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:10,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {54613#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54613#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:10,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {54613#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54614#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:10,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {54614#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54614#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:10,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {54614#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54615#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:10,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {54615#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54615#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:10,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {54615#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54616#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:10,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {54616#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54616#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:10,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {54616#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54617#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:10,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {54617#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54617#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:10,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {54617#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54618#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:10,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {54618#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54618#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:10,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {54618#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54619#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:10,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {54619#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54619#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:10,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {54619#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54620#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:10,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {54620#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54620#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:10,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {54620#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54621#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:10,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {54621#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54621#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:10,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {54621#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54622#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:10,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {54622#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54622#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:10,435 INFO L290 TraceCheckUtils]: 53: Hoare triple {54622#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54623#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:10,435 INFO L290 TraceCheckUtils]: 54: Hoare triple {54623#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54623#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:10,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {54623#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54624#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:10,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {54624#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54624#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:10,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {54624#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54625#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:10,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {54625#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54625#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:10,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {54625#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54626#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:10,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {54626#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54626#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:10,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {54626#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54627#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:10,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {54627#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54627#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:10,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {54627#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54628#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:10,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {54628#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54628#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:10,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {54628#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54629#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:10,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {54629#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54629#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:10,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {54629#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54630#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:10,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {54630#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54630#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:10,442 INFO L290 TraceCheckUtils]: 69: Hoare triple {54630#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54631#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:10,442 INFO L290 TraceCheckUtils]: 70: Hoare triple {54631#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54631#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:10,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {54631#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54632#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:10,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {54632#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54632#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:10,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {54632#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54633#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:10,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {54633#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54633#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:10,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {54633#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54634#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:10,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {54634#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54634#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:10,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {54634#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54635#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:10,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {54635#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54635#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:10,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {54635#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54636#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:10,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {54636#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54636#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:10,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {54636#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54637#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:10,447 INFO L290 TraceCheckUtils]: 82: Hoare triple {54637#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54637#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:10,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {54637#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54638#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:10,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {54638#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54638#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:10,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {54638#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54639#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:10,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {54639#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54639#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:10,449 INFO L290 TraceCheckUtils]: 87: Hoare triple {54639#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54640#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:10,450 INFO L290 TraceCheckUtils]: 88: Hoare triple {54640#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54640#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:10,450 INFO L290 TraceCheckUtils]: 89: Hoare triple {54640#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54641#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:10,451 INFO L290 TraceCheckUtils]: 90: Hoare triple {54641#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54641#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:10,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {54641#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54642#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:10,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {54642#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54642#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:10,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {54642#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54643#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:10,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {54643#(<= main_~i~0 44)} assume !(~i~0 < 1023); {54595#false} is VALID [2022-04-15 12:20:10,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {54595#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 96: Hoare triple {54595#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 97: Hoare triple {54595#false} assume !!(0 != #t~mem4);havoc #t~mem4; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {54595#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 99: Hoare triple {54595#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {54595#false} assume !!(0 != #t~mem4);havoc #t~mem4; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 101: Hoare triple {54595#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 102: Hoare triple {54595#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 103: Hoare triple {54595#false} assume !(0 != #t~mem4);havoc #t~mem4; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L272 TraceCheckUtils]: 104: Hoare triple {54595#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 105: Hoare triple {54595#false} ~cond := #in~cond; {54595#false} is VALID [2022-04-15 12:20:10,453 INFO L290 TraceCheckUtils]: 106: Hoare triple {54595#false} assume 0 == ~cond; {54595#false} is VALID [2022-04-15 12:20:10,454 INFO L290 TraceCheckUtils]: 107: Hoare triple {54595#false} assume !false; {54595#false} is VALID [2022-04-15 12:20:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847398163] [2022-04-15 12:20:10,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847398163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136229745] [2022-04-15 12:20:10,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:20:10,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:10,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:10,457 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-15 12:20:10,459 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-15 12:20:10,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:20:10,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:10,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:20:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:10,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:11,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {54594#true} call ULTIMATE.init(); {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {54594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {54594#true} call #t~ret5 := main(); {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {54594#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {54594#true} assume !(~i~0 < 1023); {54594#true} is VALID [2022-04-15 12:20:11,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {54594#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {54933#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:11,042 INFO L290 TraceCheckUtils]: 96: Hoare triple {54933#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54933#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:11,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {54933#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {54933#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:11,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {54933#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:11,043 INFO L290 TraceCheckUtils]: 99: Hoare triple {54600#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54600#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:11,043 INFO L290 TraceCheckUtils]: 100: Hoare triple {54600#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:11,043 INFO L290 TraceCheckUtils]: 101: Hoare triple {54600#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:11,044 INFO L290 TraceCheckUtils]: 102: Hoare triple {54601#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54601#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:11,044 INFO L290 TraceCheckUtils]: 103: Hoare triple {54601#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:11,044 INFO L272 TraceCheckUtils]: 104: Hoare triple {54601#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:11,045 INFO L290 TraceCheckUtils]: 105: Hoare triple {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {54965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:11,045 INFO L290 TraceCheckUtils]: 106: Hoare triple {54965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54595#false} is VALID [2022-04-15 12:20:11,045 INFO L290 TraceCheckUtils]: 107: Hoare triple {54595#false} assume !false; {54595#false} is VALID [2022-04-15 12:20:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 12:20:11,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:11,340 INFO L290 TraceCheckUtils]: 107: Hoare triple {54595#false} assume !false; {54595#false} is VALID [2022-04-15 12:20:11,340 INFO L290 TraceCheckUtils]: 106: Hoare triple {54965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54595#false} is VALID [2022-04-15 12:20:11,341 INFO L290 TraceCheckUtils]: 105: Hoare triple {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {54965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:11,341 INFO L272 TraceCheckUtils]: 104: Hoare triple {54981#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:11,341 INFO L290 TraceCheckUtils]: 103: Hoare triple {54981#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {54981#(<= main_~i~0 1024)} is VALID [2022-04-15 12:20:11,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {54981#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54981#(<= main_~i~0 1024)} is VALID [2022-04-15 12:20:11,342 INFO L290 TraceCheckUtils]: 101: Hoare triple {54991#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54981#(<= main_~i~0 1024)} is VALID [2022-04-15 12:20:11,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {54991#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {54991#(<= main_~i~0 1023)} is VALID [2022-04-15 12:20:11,343 INFO L290 TraceCheckUtils]: 99: Hoare triple {54991#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54991#(<= main_~i~0 1023)} is VALID [2022-04-15 12:20:11,343 INFO L290 TraceCheckUtils]: 98: Hoare triple {55001#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54991#(<= main_~i~0 1023)} is VALID [2022-04-15 12:20:11,343 INFO L290 TraceCheckUtils]: 97: Hoare triple {55001#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {55001#(<= main_~i~0 1022)} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 96: Hoare triple {55001#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {55001#(<= main_~i~0 1022)} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 95: Hoare triple {54594#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {55001#(<= main_~i~0 1022)} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 94: Hoare triple {54594#true} assume !(~i~0 < 1023); {54594#true} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 93: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 92: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 91: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 90: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,344 INFO L290 TraceCheckUtils]: 89: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 87: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 86: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 85: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 84: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 83: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 82: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 81: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 80: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 79: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 78: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 77: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 76: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 75: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,345 INFO L290 TraceCheckUtils]: 74: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 71: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 70: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {54594#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {54594#true} call #t~ret5 := main(); {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {54594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {54594#true} is VALID [2022-04-15 12:20:11,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {54594#true} call ULTIMATE.init(); {54594#true} is VALID [2022-04-15 12:20:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 12:20:11,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136229745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:11,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:11,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 7, 7] total 54 [2022-04-15 12:20:11,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:11,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284412375] [2022-04-15 12:20:11,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284412375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:11,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:11,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 12:20:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552059262] [2022-04-15 12:20:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 12:20:11,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:11,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:11,427 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-15 12:20:11,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 12:20:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 12:20:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=1581, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:20:11,428 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:19,079 INFO L93 Difference]: Finished difference Result 299 states and 344 transitions. [2022-04-15 12:20:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 12:20:19,079 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 12:20:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 339 transitions. [2022-04-15 12:20:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 339 transitions. [2022-04-15 12:20:19,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 339 transitions. [2022-04-15 12:20:19,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 339 edges. 339 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:19,384 INFO L225 Difference]: With dead ends: 299 [2022-04-15 12:20:19,384 INFO L226 Difference]: Without dead ends: 285 [2022-04-15 12:20:19,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3577, Invalid=6125, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 12:20:19,385 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 685 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:19,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 36 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-04-15 12:20:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 111. [2022-04-15 12:20:20,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:20,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 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-15 12:20:20,209 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 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-15 12:20:20,209 INFO L87 Difference]: Start difference. First operand 285 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 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-15 12:20:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:20,213 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2022-04-15 12:20:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2022-04-15 12:20:20,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:20,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:20,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 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 285 states. [2022-04-15 12:20:20,214 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 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 285 states. [2022-04-15 12:20:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:20,218 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2022-04-15 12:20:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2022-04-15 12:20:20,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:20,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:20,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:20,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 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-15 12:20:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-04-15 12:20:20,225 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2022-04-15 12:20:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:20,225 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-04-15 12:20:20,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:20,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 112 transitions. [2022-04-15 12:20:20,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-04-15 12:20:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 12:20:20,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:20,490 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:20,520 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-15 12:20:20,703 WARN L460 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-15 12:20:20,703 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1375485143, now seen corresponding path program 91 times [2022-04-15 12:20:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:20,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388975502] [2022-04-15 12:20:20,715 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:20,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1375485143, now seen corresponding path program 92 times [2022-04-15 12:20:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:20,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866661069] [2022-04-15 12:20:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:21,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {56829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {56778#true} is VALID [2022-04-15 12:20:21,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 12:20:21,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 12:20:21,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {56778#true} call ULTIMATE.init(); {56829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:21,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {56829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {56778#true} is VALID [2022-04-15 12:20:21,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 12:20:21,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 12:20:21,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {56778#true} call #t~ret5 := main(); {56778#true} is VALID [2022-04-15 12:20:21,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {56778#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56783#(= main_~i~0 0)} is VALID [2022-04-15 12:20:21,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {56783#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56783#(= main_~i~0 0)} is VALID [2022-04-15 12:20:21,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {56783#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:21,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {56784#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:21,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {56784#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:21,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {56785#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:21,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {56785#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:21,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {56786#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:21,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {56786#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:21,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {56787#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:21,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {56787#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:21,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {56788#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:21,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {56788#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:21,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {56789#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:21,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {56789#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:21,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {56790#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:21,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {56790#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:21,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {56791#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:21,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {56791#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:21,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {56792#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:21,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {56792#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:21,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {56793#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:21,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {56793#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:21,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {56794#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:21,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {56794#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:21,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {56795#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:21,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {56795#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:21,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {56796#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:21,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {56796#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:21,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {56797#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:21,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {56797#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:21,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {56798#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:21,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {56798#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:21,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {56799#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:21,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {56799#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:21,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {56800#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:21,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {56800#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:21,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {56801#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:21,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {56801#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:21,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {56802#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:21,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {56802#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:21,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {56803#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:21,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {56803#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:21,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {56804#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:21,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {56804#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:21,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {56805#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:21,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {56805#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:21,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {56806#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:21,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {56806#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:21,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {56807#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:21,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {56807#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:21,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {56808#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:21,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {56808#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:21,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {56809#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:21,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {56809#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:21,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {56810#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:21,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {56810#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:21,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {56811#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:21,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {56811#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:21,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {56812#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:21,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {56812#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:21,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {56813#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:21,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {56813#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:21,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {56814#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:21,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {56814#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:21,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {56815#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:21,872 INFO L290 TraceCheckUtils]: 71: Hoare triple {56815#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:21,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {56816#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:21,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {56816#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:21,873 INFO L290 TraceCheckUtils]: 74: Hoare triple {56817#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:21,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {56817#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:21,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {56818#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:21,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {56818#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:21,875 INFO L290 TraceCheckUtils]: 78: Hoare triple {56819#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:21,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {56819#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:21,876 INFO L290 TraceCheckUtils]: 80: Hoare triple {56820#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:21,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {56820#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:21,876 INFO L290 TraceCheckUtils]: 82: Hoare triple {56821#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:21,877 INFO L290 TraceCheckUtils]: 83: Hoare triple {56821#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:21,877 INFO L290 TraceCheckUtils]: 84: Hoare triple {56822#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:21,877 INFO L290 TraceCheckUtils]: 85: Hoare triple {56822#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:21,878 INFO L290 TraceCheckUtils]: 86: Hoare triple {56823#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:21,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {56823#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:21,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {56824#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:21,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {56824#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:21,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {56825#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:21,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {56825#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:21,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {56826#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:21,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {56826#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:21,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {56827#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:21,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {56827#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56828#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {56828#(<= main_~i~0 45)} assume !(~i~0 < 1023); {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {56779#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 12:20:21,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:21,883 INFO L290 TraceCheckUtils]: 105: Hoare triple {56779#false} assume !(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:21,883 INFO L272 TraceCheckUtils]: 106: Hoare triple {56779#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {56779#false} is VALID [2022-04-15 12:20:21,883 INFO L290 TraceCheckUtils]: 107: Hoare triple {56779#false} ~cond := #in~cond; {56779#false} is VALID [2022-04-15 12:20:21,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {56779#false} assume 0 == ~cond; {56779#false} is VALID [2022-04-15 12:20:21,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {56779#false} assume !false; {56779#false} is VALID [2022-04-15 12:20:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:21,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:21,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866661069] [2022-04-15 12:20:21,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866661069] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:21,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828832827] [2022-04-15 12:20:21,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:20:21,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:21,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:21,885 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-15 12:20:21,887 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-15 12:20:22,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:20:22,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:22,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 12:20:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:22,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:23,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {56778#true} call ULTIMATE.init(); {56778#true} is VALID [2022-04-15 12:20:23,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {56778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {56778#true} is VALID [2022-04-15 12:20:23,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 12:20:23,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 12:20:23,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {56778#true} call #t~ret5 := main(); {56778#true} is VALID [2022-04-15 12:20:23,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {56778#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56848#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:23,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {56848#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56848#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:23,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {56848#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:23,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {56784#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:23,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {56784#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:23,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {56785#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:23,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {56785#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:23,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {56786#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:23,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {56786#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:23,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {56787#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:23,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {56787#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:23,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {56788#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:23,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {56788#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:23,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {56789#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:23,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {56789#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:23,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {56790#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:23,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {56790#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:23,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {56791#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:23,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {56791#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:23,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {56792#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:23,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {56792#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:23,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {56793#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:23,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {56793#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:23,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {56794#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:23,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {56794#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:23,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {56795#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:23,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {56795#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:23,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {56796#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:23,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {56796#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:23,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {56797#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:23,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {56797#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:23,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {56798#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:23,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {56798#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:23,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {56799#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:23,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {56799#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:23,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {56800#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:23,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {56800#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:23,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {56801#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:23,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {56801#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:23,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {56802#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:23,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {56802#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:23,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {56803#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:23,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {56803#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:23,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {56804#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:23,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {56804#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:23,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {56805#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:23,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {56805#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:23,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {56806#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:23,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {56806#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:23,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {56807#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:23,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {56807#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:23,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {56808#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:23,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {56808#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:23,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {56809#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:23,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {56809#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:23,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {56810#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:23,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {56810#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:23,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {56811#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:23,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {56811#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:23,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {56812#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:23,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {56812#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:23,069 INFO L290 TraceCheckUtils]: 66: Hoare triple {56813#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:23,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {56813#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:23,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {56814#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:23,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {56814#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:23,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {56815#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:23,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {56815#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:23,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {56816#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:23,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {56816#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:23,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {56817#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:23,073 INFO L290 TraceCheckUtils]: 75: Hoare triple {56817#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:23,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {56818#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:23,073 INFO L290 TraceCheckUtils]: 77: Hoare triple {56818#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:23,074 INFO L290 TraceCheckUtils]: 78: Hoare triple {56819#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:23,074 INFO L290 TraceCheckUtils]: 79: Hoare triple {56819#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:23,074 INFO L290 TraceCheckUtils]: 80: Hoare triple {56820#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:23,075 INFO L290 TraceCheckUtils]: 81: Hoare triple {56820#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:23,075 INFO L290 TraceCheckUtils]: 82: Hoare triple {56821#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:23,076 INFO L290 TraceCheckUtils]: 83: Hoare triple {56821#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:23,076 INFO L290 TraceCheckUtils]: 84: Hoare triple {56822#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:23,076 INFO L290 TraceCheckUtils]: 85: Hoare triple {56822#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:23,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {56823#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:23,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {56823#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:23,078 INFO L290 TraceCheckUtils]: 88: Hoare triple {56824#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:23,078 INFO L290 TraceCheckUtils]: 89: Hoare triple {56824#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:23,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {56825#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:23,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {56825#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:23,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {56826#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:23,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {56826#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:23,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {56827#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:23,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {56827#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56828#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {56828#(<= main_~i~0 45)} assume !(~i~0 < 1023); {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 97: Hoare triple {56779#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 99: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 100: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 101: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 102: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:23,081 INFO L290 TraceCheckUtils]: 103: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L290 TraceCheckUtils]: 104: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L290 TraceCheckUtils]: 105: Hoare triple {56779#false} assume !(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L272 TraceCheckUtils]: 106: Hoare triple {56779#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L290 TraceCheckUtils]: 107: Hoare triple {56779#false} ~cond := #in~cond; {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L290 TraceCheckUtils]: 108: Hoare triple {56779#false} assume 0 == ~cond; {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L290 TraceCheckUtils]: 109: Hoare triple {56779#false} assume !false; {56779#false} is VALID [2022-04-15 12:20:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:23,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:25,696 INFO L290 TraceCheckUtils]: 109: Hoare triple {56779#false} assume !false; {56779#false} is VALID [2022-04-15 12:20:25,696 INFO L290 TraceCheckUtils]: 108: Hoare triple {56779#false} assume 0 == ~cond; {56779#false} is VALID [2022-04-15 12:20:25,696 INFO L290 TraceCheckUtils]: 107: Hoare triple {56779#false} ~cond := #in~cond; {56779#false} is VALID [2022-04-15 12:20:25,696 INFO L272 TraceCheckUtils]: 106: Hoare triple {56779#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {56779#false} is VALID [2022-04-15 12:20:25,696 INFO L290 TraceCheckUtils]: 105: Hoare triple {56779#false} assume !(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:25,696 INFO L290 TraceCheckUtils]: 104: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 103: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 102: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 101: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 99: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {56779#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {56779#false} is VALID [2022-04-15 12:20:25,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {57200#(< main_~i~0 1023)} assume !(~i~0 < 1023); {56779#false} is VALID [2022-04-15 12:20:25,698 INFO L290 TraceCheckUtils]: 95: Hoare triple {57204#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57200#(< main_~i~0 1023)} is VALID [2022-04-15 12:20:25,698 INFO L290 TraceCheckUtils]: 94: Hoare triple {57204#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57204#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:25,698 INFO L290 TraceCheckUtils]: 93: Hoare triple {57211#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57204#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:25,699 INFO L290 TraceCheckUtils]: 92: Hoare triple {57211#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57211#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:25,699 INFO L290 TraceCheckUtils]: 91: Hoare triple {57218#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57211#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:25,699 INFO L290 TraceCheckUtils]: 90: Hoare triple {57218#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57218#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:25,700 INFO L290 TraceCheckUtils]: 89: Hoare triple {57225#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57218#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:25,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {57225#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57225#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:25,700 INFO L290 TraceCheckUtils]: 87: Hoare triple {57232#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57225#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:25,701 INFO L290 TraceCheckUtils]: 86: Hoare triple {57232#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57232#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:25,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {57239#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57232#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:25,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {57239#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57239#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:25,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {57246#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57239#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:25,702 INFO L290 TraceCheckUtils]: 82: Hoare triple {57246#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57246#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:25,702 INFO L290 TraceCheckUtils]: 81: Hoare triple {57253#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57246#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:25,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {57253#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57253#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:25,703 INFO L290 TraceCheckUtils]: 79: Hoare triple {57260#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57253#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:25,703 INFO L290 TraceCheckUtils]: 78: Hoare triple {57260#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57260#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:25,704 INFO L290 TraceCheckUtils]: 77: Hoare triple {57267#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57260#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:25,704 INFO L290 TraceCheckUtils]: 76: Hoare triple {57267#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57267#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:25,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {57274#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57267#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:25,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {57274#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57274#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:25,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {57281#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57274#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:25,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {57281#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57281#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:25,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {57288#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57281#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:25,706 INFO L290 TraceCheckUtils]: 70: Hoare triple {57288#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57288#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:25,706 INFO L290 TraceCheckUtils]: 69: Hoare triple {57295#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57288#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:25,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {57295#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57295#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:25,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {57302#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57295#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:25,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {57302#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57302#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:25,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {57309#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57302#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:25,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {57309#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57309#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:25,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {57316#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57309#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:25,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {57316#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57316#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:25,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {57323#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57316#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:25,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {57323#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57323#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:25,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {57330#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57323#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:25,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {57330#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57330#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:25,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {57337#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57330#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:25,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {57337#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57337#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:25,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {57344#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57337#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:25,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {57344#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57344#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:25,711 INFO L290 TraceCheckUtils]: 53: Hoare triple {57351#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57344#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:25,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {57351#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57351#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:25,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {57358#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57351#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:25,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {57358#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57358#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:25,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {57365#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57358#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:25,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {57365#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57365#(< main_~i~0 999)} is VALID [2022-04-15 12:20:25,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {57372#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57365#(< main_~i~0 999)} is VALID [2022-04-15 12:20:25,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {57372#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57372#(< main_~i~0 998)} is VALID [2022-04-15 12:20:25,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {57379#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57372#(< main_~i~0 998)} is VALID [2022-04-15 12:20:25,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {57379#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57379#(< main_~i~0 997)} is VALID [2022-04-15 12:20:25,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {57386#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57379#(< main_~i~0 997)} is VALID [2022-04-15 12:20:25,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {57386#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57386#(< main_~i~0 996)} is VALID [2022-04-15 12:20:25,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {57393#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57386#(< main_~i~0 996)} is VALID [2022-04-15 12:20:25,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {57393#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57393#(< main_~i~0 995)} is VALID [2022-04-15 12:20:25,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {57400#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57393#(< main_~i~0 995)} is VALID [2022-04-15 12:20:25,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {57400#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57400#(< main_~i~0 994)} is VALID [2022-04-15 12:20:25,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {57407#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57400#(< main_~i~0 994)} is VALID [2022-04-15 12:20:25,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {57407#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57407#(< main_~i~0 993)} is VALID [2022-04-15 12:20:25,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {57414#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57407#(< main_~i~0 993)} is VALID [2022-04-15 12:20:25,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {57414#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57414#(< main_~i~0 992)} is VALID [2022-04-15 12:20:25,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {57421#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57414#(< main_~i~0 992)} is VALID [2022-04-15 12:20:25,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {57421#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57421#(< main_~i~0 991)} is VALID [2022-04-15 12:20:25,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {57428#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57421#(< main_~i~0 991)} is VALID [2022-04-15 12:20:25,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {57428#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57428#(< main_~i~0 990)} is VALID [2022-04-15 12:20:25,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {57435#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57428#(< main_~i~0 990)} is VALID [2022-04-15 12:20:25,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {57435#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57435#(< main_~i~0 989)} is VALID [2022-04-15 12:20:25,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {57442#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57435#(< main_~i~0 989)} is VALID [2022-04-15 12:20:25,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {57442#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57442#(< main_~i~0 988)} is VALID [2022-04-15 12:20:25,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {57449#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57442#(< main_~i~0 988)} is VALID [2022-04-15 12:20:25,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {57449#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57449#(< main_~i~0 987)} is VALID [2022-04-15 12:20:25,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {57456#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57449#(< main_~i~0 987)} is VALID [2022-04-15 12:20:25,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {57456#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57456#(< main_~i~0 986)} is VALID [2022-04-15 12:20:25,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {57463#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57456#(< main_~i~0 986)} is VALID [2022-04-15 12:20:25,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {57463#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57463#(< main_~i~0 985)} is VALID [2022-04-15 12:20:25,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {57470#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57463#(< main_~i~0 985)} is VALID [2022-04-15 12:20:25,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {57470#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57470#(< main_~i~0 984)} is VALID [2022-04-15 12:20:25,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {57477#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57470#(< main_~i~0 984)} is VALID [2022-04-15 12:20:25,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {57477#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57477#(< main_~i~0 983)} is VALID [2022-04-15 12:20:25,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {57484#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57477#(< main_~i~0 983)} is VALID [2022-04-15 12:20:25,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {57484#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57484#(< main_~i~0 982)} is VALID [2022-04-15 12:20:25,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {57491#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57484#(< main_~i~0 982)} is VALID [2022-04-15 12:20:25,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {57491#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57491#(< main_~i~0 981)} is VALID [2022-04-15 12:20:25,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {57498#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57491#(< main_~i~0 981)} is VALID [2022-04-15 12:20:25,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {57498#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57498#(< main_~i~0 980)} is VALID [2022-04-15 12:20:25,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {57505#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57498#(< main_~i~0 980)} is VALID [2022-04-15 12:20:25,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {57505#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57505#(< main_~i~0 979)} is VALID [2022-04-15 12:20:25,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {57512#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57505#(< main_~i~0 979)} is VALID [2022-04-15 12:20:25,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {57512#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57512#(< main_~i~0 978)} is VALID [2022-04-15 12:20:25,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {56778#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57512#(< main_~i~0 978)} is VALID [2022-04-15 12:20:25,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {56778#true} call #t~ret5 := main(); {56778#true} is VALID [2022-04-15 12:20:25,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 12:20:25,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 12:20:25,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {56778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {56778#true} is VALID [2022-04-15 12:20:25,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {56778#true} call ULTIMATE.init(); {56778#true} is VALID [2022-04-15 12:20:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828832827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:25,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:25,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 12:20:25,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388975502] [2022-04-15 12:20:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388975502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:25,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:25,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 12:20:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623982576] [2022-04-15 12:20:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 12:20:25,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:25,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:25,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 12:20:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 12:20:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 12:20:25,808 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:34,034 INFO L93 Difference]: Finished difference Result 305 states and 351 transitions. [2022-04-15 12:20:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 12:20:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 12:20:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 346 transitions. [2022-04-15 12:20:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 346 transitions. [2022-04-15 12:20:34,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 346 transitions. [2022-04-15 12:20:34,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:34,348 INFO L225 Difference]: With dead ends: 305 [2022-04-15 12:20:34,348 INFO L226 Difference]: Without dead ends: 291 [2022-04-15 12:20:34,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 12:20:34,350 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 628 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:34,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 41 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-15 12:20:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 113. [2022-04-15 12:20:35,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:35,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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-15 12:20:35,077 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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-15 12:20:35,078 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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-15 12:20:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:35,082 INFO L93 Difference]: Finished difference Result 291 states and 336 transitions. [2022-04-15 12:20:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2022-04-15 12:20:35,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:35,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:35,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 291 states. [2022-04-15 12:20:35,083 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 291 states. [2022-04-15 12:20:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:35,088 INFO L93 Difference]: Finished difference Result 291 states and 336 transitions. [2022-04-15 12:20:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2022-04-15 12:20:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:35,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:35,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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-15 12:20:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2022-04-15 12:20:35,090 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2022-04-15 12:20:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:35,090 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2022-04-15 12:20:35,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:35,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 114 transitions. [2022-04-15 12:20:35,388 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-15 12:20:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 12:20:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 12:20:35,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:35,388 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:35,417 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-15 12:20:35,591 WARN L460 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-15 12:20:35,591 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -753640501, now seen corresponding path program 93 times [2022-04-15 12:20:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:35,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741115608] [2022-04-15 12:20:35,607 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:35,607 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:35,607 INFO L85 PathProgramCache]: Analyzing trace with hash -753640501, now seen corresponding path program 94 times [2022-04-15 12:20:35,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:35,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784621802] [2022-04-15 12:20:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:36,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {59098#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {59046#true} is VALID [2022-04-15 12:20:36,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 12:20:36,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 12:20:36,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {59046#true} call ULTIMATE.init(); {59098#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:36,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {59098#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {59046#true} is VALID [2022-04-15 12:20:36,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 12:20:36,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 12:20:36,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {59046#true} call #t~ret5 := main(); {59046#true} is VALID [2022-04-15 12:20:36,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {59046#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {59051#(= main_~i~0 0)} is VALID [2022-04-15 12:20:36,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {59051#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59051#(= main_~i~0 0)} is VALID [2022-04-15 12:20:36,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {59051#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:36,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {59052#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:36,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {59052#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:36,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {59053#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:36,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {59053#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:36,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {59054#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:36,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {59054#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:36,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {59055#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:36,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {59055#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:36,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {59056#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:36,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {59056#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:36,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {59057#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:36,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {59057#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:36,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {59058#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:36,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {59058#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:36,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {59059#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:36,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {59059#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:36,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {59060#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:36,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {59060#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:36,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {59061#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:36,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {59061#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:36,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {59062#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:36,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {59062#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:36,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {59063#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:36,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {59063#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:36,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {59064#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:36,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {59064#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:36,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {59065#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:36,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {59065#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:36,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {59066#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:36,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {59066#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:36,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {59067#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:36,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {59067#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:36,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {59068#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:36,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {59068#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:36,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {59069#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:36,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {59069#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:36,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {59070#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:36,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {59070#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:36,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {59071#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:36,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {59071#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:36,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {59072#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:36,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {59072#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:36,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {59073#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:36,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {59073#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:36,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {59074#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:36,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {59074#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:36,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {59075#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:36,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {59075#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:36,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {59076#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:36,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {59076#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:36,538 INFO L290 TraceCheckUtils]: 58: Hoare triple {59077#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:36,539 INFO L290 TraceCheckUtils]: 59: Hoare triple {59077#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:36,539 INFO L290 TraceCheckUtils]: 60: Hoare triple {59078#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:36,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {59078#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:36,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {59079#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:36,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {59079#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:36,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {59080#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:36,541 INFO L290 TraceCheckUtils]: 65: Hoare triple {59080#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:36,541 INFO L290 TraceCheckUtils]: 66: Hoare triple {59081#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:36,541 INFO L290 TraceCheckUtils]: 67: Hoare triple {59081#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:36,541 INFO L290 TraceCheckUtils]: 68: Hoare triple {59082#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:36,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {59082#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:36,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {59083#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:36,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {59083#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:36,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {59084#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:36,543 INFO L290 TraceCheckUtils]: 73: Hoare triple {59084#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:36,543 INFO L290 TraceCheckUtils]: 74: Hoare triple {59085#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:36,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {59085#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:36,544 INFO L290 TraceCheckUtils]: 76: Hoare triple {59086#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:36,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {59086#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:36,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {59087#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:36,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {59087#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:36,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {59088#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:36,546 INFO L290 TraceCheckUtils]: 81: Hoare triple {59088#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:36,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {59089#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:36,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {59089#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:36,547 INFO L290 TraceCheckUtils]: 84: Hoare triple {59090#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:36,547 INFO L290 TraceCheckUtils]: 85: Hoare triple {59090#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:36,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {59091#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:36,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {59091#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:36,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {59092#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:36,548 INFO L290 TraceCheckUtils]: 89: Hoare triple {59092#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:36,549 INFO L290 TraceCheckUtils]: 90: Hoare triple {59093#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:36,549 INFO L290 TraceCheckUtils]: 91: Hoare triple {59093#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:36,549 INFO L290 TraceCheckUtils]: 92: Hoare triple {59094#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:36,550 INFO L290 TraceCheckUtils]: 93: Hoare triple {59094#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:36,550 INFO L290 TraceCheckUtils]: 94: Hoare triple {59095#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:36,550 INFO L290 TraceCheckUtils]: 95: Hoare triple {59095#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:36,550 INFO L290 TraceCheckUtils]: 96: Hoare triple {59096#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:36,551 INFO L290 TraceCheckUtils]: 97: Hoare triple {59096#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59097#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:36,551 INFO L290 TraceCheckUtils]: 98: Hoare triple {59097#(<= main_~i~0 46)} assume !(~i~0 < 1023); {59047#false} is VALID [2022-04-15 12:20:36,551 INFO L290 TraceCheckUtils]: 99: Hoare triple {59047#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {59047#false} is VALID [2022-04-15 12:20:36,551 INFO L290 TraceCheckUtils]: 100: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:36,551 INFO L290 TraceCheckUtils]: 101: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:36,551 INFO L290 TraceCheckUtils]: 102: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 103: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 104: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 105: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 106: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 107: Hoare triple {59047#false} assume !(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L272 TraceCheckUtils]: 108: Hoare triple {59047#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 109: Hoare triple {59047#false} ~cond := #in~cond; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 110: Hoare triple {59047#false} assume 0 == ~cond; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L290 TraceCheckUtils]: 111: Hoare triple {59047#false} assume !false; {59047#false} is VALID [2022-04-15 12:20:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:36,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784621802] [2022-04-15 12:20:36,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784621802] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:36,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110957199] [2022-04-15 12:20:36,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:20:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:36,554 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-15 12:20:36,554 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-15 12:20:36,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:20:36,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:36,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:20:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:36,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:37,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {59046#true} call ULTIMATE.init(); {59046#true} is VALID [2022-04-15 12:20:37,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {59046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {59046#true} is VALID [2022-04-15 12:20:37,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 12:20:37,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 12:20:37,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {59046#true} call #t~ret5 := main(); {59046#true} is VALID [2022-04-15 12:20:37,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {59046#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {59117#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:37,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {59117#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59117#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:37,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {59117#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:37,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {59052#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:37,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {59052#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:37,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {59053#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:37,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {59053#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:37,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {59054#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:37,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {59054#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:37,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {59055#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:37,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {59055#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:37,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {59056#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:37,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {59056#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:37,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {59057#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:37,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {59057#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:37,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {59058#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:37,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {59058#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:37,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {59059#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:37,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {59059#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:37,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {59060#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:37,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {59060#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:37,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {59061#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:37,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {59061#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:37,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {59062#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:37,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {59062#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:37,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {59063#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:37,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {59063#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {59064#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {59064#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:37,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {59065#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:37,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {59065#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:37,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {59066#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:37,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {59066#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:37,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {59067#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:37,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {59067#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:37,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {59068#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:37,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {59068#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:37,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {59069#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:37,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {59069#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:37,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {59070#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:37,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {59070#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:37,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {59071#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:37,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {59071#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:37,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {59072#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:37,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {59072#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:37,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {59073#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:37,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {59073#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:37,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {59074#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:37,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {59074#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:37,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {59075#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:37,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {59075#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:37,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {59076#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:37,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {59076#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:37,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {59077#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:37,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {59077#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:37,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {59078#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:37,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {59078#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:37,469 INFO L290 TraceCheckUtils]: 62: Hoare triple {59079#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:37,470 INFO L290 TraceCheckUtils]: 63: Hoare triple {59079#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:37,470 INFO L290 TraceCheckUtils]: 64: Hoare triple {59080#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:37,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {59080#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:37,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {59081#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:37,471 INFO L290 TraceCheckUtils]: 67: Hoare triple {59081#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:37,471 INFO L290 TraceCheckUtils]: 68: Hoare triple {59082#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:37,472 INFO L290 TraceCheckUtils]: 69: Hoare triple {59082#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:37,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {59083#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:37,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {59083#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:37,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {59084#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:37,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {59084#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:37,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {59085#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:37,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {59085#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:37,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {59086#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:37,474 INFO L290 TraceCheckUtils]: 77: Hoare triple {59086#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:37,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {59087#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:37,475 INFO L290 TraceCheckUtils]: 79: Hoare triple {59087#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:37,475 INFO L290 TraceCheckUtils]: 80: Hoare triple {59088#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:37,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {59088#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:37,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {59089#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:37,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {59089#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:37,476 INFO L290 TraceCheckUtils]: 84: Hoare triple {59090#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:37,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {59090#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:37,477 INFO L290 TraceCheckUtils]: 86: Hoare triple {59091#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:37,477 INFO L290 TraceCheckUtils]: 87: Hoare triple {59091#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:37,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {59092#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:37,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {59092#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:37,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {59093#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:37,479 INFO L290 TraceCheckUtils]: 91: Hoare triple {59093#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:37,479 INFO L290 TraceCheckUtils]: 92: Hoare triple {59094#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:37,479 INFO L290 TraceCheckUtils]: 93: Hoare triple {59094#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:37,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {59095#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:37,480 INFO L290 TraceCheckUtils]: 95: Hoare triple {59095#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:37,480 INFO L290 TraceCheckUtils]: 96: Hoare triple {59096#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 97: Hoare triple {59096#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59097#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {59097#(<= main_~i~0 46)} assume !(~i~0 < 1023); {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 99: Hoare triple {59047#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 103: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 104: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 12:20:37,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:37,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {59047#false} assume !(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:37,482 INFO L272 TraceCheckUtils]: 108: Hoare triple {59047#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {59047#false} is VALID [2022-04-15 12:20:37,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {59047#false} ~cond := #in~cond; {59047#false} is VALID [2022-04-15 12:20:37,482 INFO L290 TraceCheckUtils]: 110: Hoare triple {59047#false} assume 0 == ~cond; {59047#false} is VALID [2022-04-15 12:20:37,482 INFO L290 TraceCheckUtils]: 111: Hoare triple {59047#false} assume !false; {59047#false} is VALID [2022-04-15 12:20:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:37,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:40,163 INFO L290 TraceCheckUtils]: 111: Hoare triple {59047#false} assume !false; {59047#false} is VALID [2022-04-15 12:20:40,163 INFO L290 TraceCheckUtils]: 110: Hoare triple {59047#false} assume 0 == ~cond; {59047#false} is VALID [2022-04-15 12:20:40,163 INFO L290 TraceCheckUtils]: 109: Hoare triple {59047#false} ~cond := #in~cond; {59047#false} is VALID [2022-04-15 12:20:40,163 INFO L272 TraceCheckUtils]: 108: Hoare triple {59047#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {59047#false} is VALID [2022-04-15 12:20:40,163 INFO L290 TraceCheckUtils]: 107: Hoare triple {59047#false} assume !(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:40,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:40,163 INFO L290 TraceCheckUtils]: 105: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 104: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 103: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 102: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 101: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 99: Hoare triple {59047#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {59047#false} is VALID [2022-04-15 12:20:40,164 INFO L290 TraceCheckUtils]: 98: Hoare triple {59475#(< main_~i~0 1023)} assume !(~i~0 < 1023); {59047#false} is VALID [2022-04-15 12:20:40,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {59479#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59475#(< main_~i~0 1023)} is VALID [2022-04-15 12:20:40,165 INFO L290 TraceCheckUtils]: 96: Hoare triple {59479#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59479#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:40,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {59486#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59479#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:40,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {59486#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59486#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:40,166 INFO L290 TraceCheckUtils]: 93: Hoare triple {59493#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59486#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:40,166 INFO L290 TraceCheckUtils]: 92: Hoare triple {59493#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59493#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:40,167 INFO L290 TraceCheckUtils]: 91: Hoare triple {59500#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59493#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:40,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {59500#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59500#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:40,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {59507#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59500#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:40,167 INFO L290 TraceCheckUtils]: 88: Hoare triple {59507#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59507#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:40,168 INFO L290 TraceCheckUtils]: 87: Hoare triple {59514#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59507#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:40,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {59514#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59514#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:40,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {59521#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59514#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:40,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {59521#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59521#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:40,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {59528#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59521#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:40,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {59528#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59528#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:40,170 INFO L290 TraceCheckUtils]: 81: Hoare triple {59535#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59528#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:40,170 INFO L290 TraceCheckUtils]: 80: Hoare triple {59535#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59535#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:40,171 INFO L290 TraceCheckUtils]: 79: Hoare triple {59542#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59535#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:40,171 INFO L290 TraceCheckUtils]: 78: Hoare triple {59542#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59542#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:40,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {59549#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59542#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:40,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {59549#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59549#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:40,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {59556#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59549#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:40,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {59556#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59556#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:40,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {59563#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59556#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:40,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {59563#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59563#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:40,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {59570#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59563#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:40,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {59570#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59570#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:40,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {59577#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59570#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:40,175 INFO L290 TraceCheckUtils]: 68: Hoare triple {59577#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59577#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:40,175 INFO L290 TraceCheckUtils]: 67: Hoare triple {59584#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59577#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:40,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {59584#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59584#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:40,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {59591#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59584#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:40,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {59591#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59591#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:40,176 INFO L290 TraceCheckUtils]: 63: Hoare triple {59598#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59591#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:40,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {59598#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59598#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:40,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {59605#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59598#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:40,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {59605#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59605#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:40,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {59612#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59605#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:40,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {59612#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59612#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:40,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {59619#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59612#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:40,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {59619#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59619#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:40,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {59626#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59619#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:40,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {59626#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59626#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:40,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {59633#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59626#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:40,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {59633#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59633#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:40,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {59640#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59633#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:40,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {59640#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59640#(< main_~i~0 999)} is VALID [2022-04-15 12:20:40,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {59647#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59640#(< main_~i~0 999)} is VALID [2022-04-15 12:20:40,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {59647#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59647#(< main_~i~0 998)} is VALID [2022-04-15 12:20:40,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {59654#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59647#(< main_~i~0 998)} is VALID [2022-04-15 12:20:40,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {59654#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59654#(< main_~i~0 997)} is VALID [2022-04-15 12:20:40,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {59661#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59654#(< main_~i~0 997)} is VALID [2022-04-15 12:20:40,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {59661#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59661#(< main_~i~0 996)} is VALID [2022-04-15 12:20:40,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {59668#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59661#(< main_~i~0 996)} is VALID [2022-04-15 12:20:40,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {59668#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59668#(< main_~i~0 995)} is VALID [2022-04-15 12:20:40,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {59675#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59668#(< main_~i~0 995)} is VALID [2022-04-15 12:20:40,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {59675#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59675#(< main_~i~0 994)} is VALID [2022-04-15 12:20:40,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {59682#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59675#(< main_~i~0 994)} is VALID [2022-04-15 12:20:40,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {59682#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59682#(< main_~i~0 993)} is VALID [2022-04-15 12:20:40,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {59689#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59682#(< main_~i~0 993)} is VALID [2022-04-15 12:20:40,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {59689#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59689#(< main_~i~0 992)} is VALID [2022-04-15 12:20:40,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {59696#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59689#(< main_~i~0 992)} is VALID [2022-04-15 12:20:40,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {59696#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59696#(< main_~i~0 991)} is VALID [2022-04-15 12:20:40,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {59703#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59696#(< main_~i~0 991)} is VALID [2022-04-15 12:20:40,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {59703#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59703#(< main_~i~0 990)} is VALID [2022-04-15 12:20:40,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {59710#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59703#(< main_~i~0 990)} is VALID [2022-04-15 12:20:40,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {59710#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59710#(< main_~i~0 989)} is VALID [2022-04-15 12:20:40,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {59717#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59710#(< main_~i~0 989)} is VALID [2022-04-15 12:20:40,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {59717#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59717#(< main_~i~0 988)} is VALID [2022-04-15 12:20:40,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {59724#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59717#(< main_~i~0 988)} is VALID [2022-04-15 12:20:40,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {59724#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59724#(< main_~i~0 987)} is VALID [2022-04-15 12:20:40,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {59731#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59724#(< main_~i~0 987)} is VALID [2022-04-15 12:20:40,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {59731#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59731#(< main_~i~0 986)} is VALID [2022-04-15 12:20:40,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {59738#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59731#(< main_~i~0 986)} is VALID [2022-04-15 12:20:40,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {59738#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59738#(< main_~i~0 985)} is VALID [2022-04-15 12:20:40,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {59745#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59738#(< main_~i~0 985)} is VALID [2022-04-15 12:20:40,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {59745#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59745#(< main_~i~0 984)} is VALID [2022-04-15 12:20:40,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {59752#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59745#(< main_~i~0 984)} is VALID [2022-04-15 12:20:40,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {59752#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59752#(< main_~i~0 983)} is VALID [2022-04-15 12:20:40,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {59759#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59752#(< main_~i~0 983)} is VALID [2022-04-15 12:20:40,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {59759#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59759#(< main_~i~0 982)} is VALID [2022-04-15 12:20:40,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {59766#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59759#(< main_~i~0 982)} is VALID [2022-04-15 12:20:40,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {59766#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59766#(< main_~i~0 981)} is VALID [2022-04-15 12:20:40,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {59773#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59766#(< main_~i~0 981)} is VALID [2022-04-15 12:20:40,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {59773#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59773#(< main_~i~0 980)} is VALID [2022-04-15 12:20:40,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {59780#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59773#(< main_~i~0 980)} is VALID [2022-04-15 12:20:40,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {59780#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59780#(< main_~i~0 979)} is VALID [2022-04-15 12:20:40,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {59787#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59780#(< main_~i~0 979)} is VALID [2022-04-15 12:20:40,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {59787#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59787#(< main_~i~0 978)} is VALID [2022-04-15 12:20:40,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {59794#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59787#(< main_~i~0 978)} is VALID [2022-04-15 12:20:40,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {59794#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59794#(< main_~i~0 977)} is VALID [2022-04-15 12:20:40,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {59046#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {59794#(< main_~i~0 977)} is VALID [2022-04-15 12:20:40,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {59046#true} call #t~ret5 := main(); {59046#true} is VALID [2022-04-15 12:20:40,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 12:20:40,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 12:20:40,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {59046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {59046#true} is VALID [2022-04-15 12:20:40,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {59046#true} call ULTIMATE.init(); {59046#true} is VALID [2022-04-15 12:20:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:40,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110957199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:40,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:40,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 12:20:40,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:40,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741115608] [2022-04-15 12:20:40,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741115608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:40,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:40,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 12:20:40,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166218745] [2022-04-15 12:20:40,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 12:20:40,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:40,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:40,266 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-15 12:20:40,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 12:20:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 12:20:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 12:20:40,268 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:49,483 INFO L93 Difference]: Finished difference Result 311 states and 358 transitions. [2022-04-15 12:20:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 12:20:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 12:20:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 353 transitions. [2022-04-15 12:20:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 353 transitions. [2022-04-15 12:20:49,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 353 transitions. [2022-04-15 12:20:49,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:49,739 INFO L225 Difference]: With dead ends: 311 [2022-04-15 12:20:49,739 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 12:20:49,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 12:20:49,740 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 647 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:49,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 46 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 12:20:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 115. [2022-04-15 12:20:50,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:50,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 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-15 12:20:50,414 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 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-15 12:20:50,414 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 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-15 12:20:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:50,419 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2022-04-15 12:20:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 343 transitions. [2022-04-15 12:20:50,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:50,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:50,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 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 297 states. [2022-04-15 12:20:50,420 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 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 297 states. [2022-04-15 12:20:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:50,424 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2022-04-15 12:20:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 343 transitions. [2022-04-15 12:20:50,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:50,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:50,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:50,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 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-15 12:20:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-04-15 12:20:50,426 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2022-04-15 12:20:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:50,427 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-04-15 12:20:50,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:50,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 116 transitions. [2022-04-15 12:20:50,668 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-15 12:20:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-04-15 12:20:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 12:20:50,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:50,669 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:50,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 12:20:50,869 WARN L460 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-15 12:20:50,869 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash -161393683, now seen corresponding path program 95 times [2022-04-15 12:20:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:50,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444645158] [2022-04-15 12:20:50,874 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:50,874 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash -161393683, now seen corresponding path program 96 times [2022-04-15 12:20:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:50,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797418490] [2022-04-15 12:20:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:51,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {61411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {61358#true} is VALID [2022-04-15 12:20:51,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 12:20:51,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 12:20:51,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {61358#true} call ULTIMATE.init(); {61411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:51,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {61411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {61358#true} is VALID [2022-04-15 12:20:51,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 12:20:51,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 12:20:51,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {61358#true} call #t~ret5 := main(); {61358#true} is VALID [2022-04-15 12:20:51,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {61358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {61363#(= main_~i~0 0)} is VALID [2022-04-15 12:20:51,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {61363#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61363#(= main_~i~0 0)} is VALID [2022-04-15 12:20:51,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {61363#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:51,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {61364#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:51,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {61364#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:51,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {61365#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:51,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {61365#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61366#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:51,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {61366#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61366#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:51,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {61366#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61367#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:51,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {61367#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61367#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:51,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {61367#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61368#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:51,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {61368#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61368#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:51,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {61368#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61369#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:51,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {61369#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61369#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:51,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {61369#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61370#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:51,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {61370#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61370#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:51,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {61370#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61371#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:51,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {61371#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61371#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:51,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {61371#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61372#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:51,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {61372#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61372#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:51,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {61372#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61373#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:51,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {61373#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61373#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:51,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {61373#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61374#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:51,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {61374#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61374#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:51,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {61374#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61375#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:51,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {61375#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61375#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:51,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {61375#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61376#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:51,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {61376#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61376#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:51,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {61376#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61377#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:51,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {61377#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61377#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:51,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {61377#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61378#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:51,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {61378#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61378#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:51,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {61378#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61379#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:51,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {61379#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61379#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:51,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {61379#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61380#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:51,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {61380#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61380#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:51,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {61380#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61381#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:51,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {61381#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61381#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:51,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {61381#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61382#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:51,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {61382#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61382#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:51,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {61382#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61383#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:51,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {61383#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61383#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:51,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {61383#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61384#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:51,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {61384#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61384#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:51,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {61384#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61385#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:51,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {61385#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61385#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:51,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {61385#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61386#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:51,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {61386#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61386#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:51,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {61386#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61387#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:51,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {61387#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61387#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:51,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {61387#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61388#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:51,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {61388#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61388#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:51,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {61388#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61389#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:51,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {61389#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61389#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:51,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {61389#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61390#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:51,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {61390#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61390#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:51,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {61390#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61391#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:51,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {61391#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61391#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:51,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {61391#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61392#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:51,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {61392#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61392#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:51,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {61392#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61393#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:51,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {61393#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61393#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:51,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {61393#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61394#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:51,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {61394#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61394#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:51,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {61394#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61395#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:51,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {61395#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61395#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:51,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {61395#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61396#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:51,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {61396#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61396#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:51,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {61396#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61397#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:51,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {61397#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61397#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:51,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {61397#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61398#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:51,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {61398#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61398#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:51,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {61398#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61399#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:51,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {61399#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61399#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:51,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {61399#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61400#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:51,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {61400#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61400#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:51,930 INFO L290 TraceCheckUtils]: 81: Hoare triple {61400#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61401#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:51,930 INFO L290 TraceCheckUtils]: 82: Hoare triple {61401#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61401#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:51,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {61401#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61402#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:51,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {61402#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61402#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:51,931 INFO L290 TraceCheckUtils]: 85: Hoare triple {61402#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61403#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:51,932 INFO L290 TraceCheckUtils]: 86: Hoare triple {61403#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61403#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:51,932 INFO L290 TraceCheckUtils]: 87: Hoare triple {61403#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61404#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:51,932 INFO L290 TraceCheckUtils]: 88: Hoare triple {61404#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61404#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:51,933 INFO L290 TraceCheckUtils]: 89: Hoare triple {61404#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61405#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:51,933 INFO L290 TraceCheckUtils]: 90: Hoare triple {61405#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61405#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:51,933 INFO L290 TraceCheckUtils]: 91: Hoare triple {61405#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61406#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:51,933 INFO L290 TraceCheckUtils]: 92: Hoare triple {61406#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61406#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:51,934 INFO L290 TraceCheckUtils]: 93: Hoare triple {61406#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61407#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:51,934 INFO L290 TraceCheckUtils]: 94: Hoare triple {61407#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61407#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:51,934 INFO L290 TraceCheckUtils]: 95: Hoare triple {61407#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61408#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:51,935 INFO L290 TraceCheckUtils]: 96: Hoare triple {61408#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61408#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:51,935 INFO L290 TraceCheckUtils]: 97: Hoare triple {61408#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61409#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:51,935 INFO L290 TraceCheckUtils]: 98: Hoare triple {61409#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61409#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 99: Hoare triple {61409#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61410#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 100: Hoare triple {61410#(<= main_~i~0 47)} assume !(~i~0 < 1023); {61359#false} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 101: Hoare triple {61359#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {61359#false} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 102: Hoare triple {61359#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61359#false} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 103: Hoare triple {61359#false} assume !!(0 != #t~mem4);havoc #t~mem4; {61359#false} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 104: Hoare triple {61359#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61359#false} is VALID [2022-04-15 12:20:51,936 INFO L290 TraceCheckUtils]: 105: Hoare triple {61359#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 106: Hoare triple {61359#false} assume !!(0 != #t~mem4);havoc #t~mem4; {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 107: Hoare triple {61359#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 108: Hoare triple {61359#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 109: Hoare triple {61359#false} assume !(0 != #t~mem4);havoc #t~mem4; {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L272 TraceCheckUtils]: 110: Hoare triple {61359#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 111: Hoare triple {61359#false} ~cond := #in~cond; {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 112: Hoare triple {61359#false} assume 0 == ~cond; {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L290 TraceCheckUtils]: 113: Hoare triple {61359#false} assume !false; {61359#false} is VALID [2022-04-15 12:20:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:20:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:51,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797418490] [2022-04-15 12:20:51,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797418490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:51,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113310569] [2022-04-15 12:20:51,938 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:20:51,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:51,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:51,939 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-15 12:20:51,940 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-15 12:20:52,207 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:20:52,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:52,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:20:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:52,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:52,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {61358#true} call ULTIMATE.init(); {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {61358#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {61358#true} call #t~ret5 := main(); {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {61358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 73: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 74: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 79: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 81: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 82: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 85: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 86: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 87: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 88: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 89: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 90: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 91: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 92: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 93: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 94: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 95: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,503 INFO L290 TraceCheckUtils]: 99: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,504 INFO L290 TraceCheckUtils]: 100: Hoare triple {61358#true} assume !(~i~0 < 1023); {61358#true} is VALID [2022-04-15 12:20:52,504 INFO L290 TraceCheckUtils]: 101: Hoare triple {61358#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {61718#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:52,504 INFO L290 TraceCheckUtils]: 102: Hoare triple {61718#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61718#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:52,504 INFO L290 TraceCheckUtils]: 103: Hoare triple {61718#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {61718#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:52,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {61718#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:52,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {61364#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61364#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:52,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {61364#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:52,506 INFO L290 TraceCheckUtils]: 107: Hoare triple {61364#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:52,506 INFO L290 TraceCheckUtils]: 108: Hoare triple {61365#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61365#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:52,506 INFO L290 TraceCheckUtils]: 109: Hoare triple {61365#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:52,507 INFO L272 TraceCheckUtils]: 110: Hoare triple {61365#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:52,507 INFO L290 TraceCheckUtils]: 111: Hoare triple {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {61750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:52,507 INFO L290 TraceCheckUtils]: 112: Hoare triple {61750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61359#false} is VALID [2022-04-15 12:20:52,508 INFO L290 TraceCheckUtils]: 113: Hoare triple {61359#false} assume !false; {61359#false} is VALID [2022-04-15 12:20:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 12:20:52,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:52,814 INFO L290 TraceCheckUtils]: 113: Hoare triple {61359#false} assume !false; {61359#false} is VALID [2022-04-15 12:20:52,815 INFO L290 TraceCheckUtils]: 112: Hoare triple {61750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61359#false} is VALID [2022-04-15 12:20:52,815 INFO L290 TraceCheckUtils]: 111: Hoare triple {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {61750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:52,816 INFO L272 TraceCheckUtils]: 110: Hoare triple {61766#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:52,816 INFO L290 TraceCheckUtils]: 109: Hoare triple {61766#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {61766#(<= main_~i~0 1024)} is VALID [2022-04-15 12:20:52,816 INFO L290 TraceCheckUtils]: 108: Hoare triple {61766#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61766#(<= main_~i~0 1024)} is VALID [2022-04-15 12:20:52,817 INFO L290 TraceCheckUtils]: 107: Hoare triple {61776#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61766#(<= main_~i~0 1024)} is VALID [2022-04-15 12:20:52,817 INFO L290 TraceCheckUtils]: 106: Hoare triple {61776#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {61776#(<= main_~i~0 1023)} is VALID [2022-04-15 12:20:52,817 INFO L290 TraceCheckUtils]: 105: Hoare triple {61776#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61776#(<= main_~i~0 1023)} is VALID [2022-04-15 12:20:52,817 INFO L290 TraceCheckUtils]: 104: Hoare triple {61786#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61776#(<= main_~i~0 1023)} is VALID [2022-04-15 12:20:52,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {61786#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {61786#(<= main_~i~0 1022)} is VALID [2022-04-15 12:20:52,818 INFO L290 TraceCheckUtils]: 102: Hoare triple {61786#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61786#(<= main_~i~0 1022)} is VALID [2022-04-15 12:20:52,818 INFO L290 TraceCheckUtils]: 101: Hoare triple {61358#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {61786#(<= main_~i~0 1022)} is VALID [2022-04-15 12:20:52,818 INFO L290 TraceCheckUtils]: 100: Hoare triple {61358#true} assume !(~i~0 < 1023); {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 99: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 98: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 96: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 95: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 94: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 92: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 91: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 89: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 84: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 83: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 82: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 80: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 79: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 78: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 67: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {61358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {61358#true} call #t~ret5 := main(); {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {61358#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {61358#true} call ULTIMATE.init(); {61358#true} is VALID [2022-04-15 12:20:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 12:20:52,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113310569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:52,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:52,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 7, 7] total 57 [2022-04-15 12:20:52,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444645158] [2022-04-15 12:20:52,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444645158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:52,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:52,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 12:20:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605476403] [2022-04-15 12:20:52,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 12:20:52,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:52,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:52,898 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-15 12:20:52,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 12:20:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 12:20:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=1755, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:20:52,899 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:00,657 INFO L93 Difference]: Finished difference Result 317 states and 365 transitions. [2022-04-15 12:21:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 12:21:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 12:21:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 360 transitions. [2022-04-15 12:21:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 360 transitions. [2022-04-15 12:21:00,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 360 transitions. [2022-04-15 12:21:00,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:00,933 INFO L225 Difference]: With dead ends: 317 [2022-04-15 12:21:00,933 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 12:21:00,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4030, Invalid=6890, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 12:21:00,934 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 681 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:00,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 36 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 12:21:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 117. [2022-04-15 12:21:01,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:01,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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-15 12:21:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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-15 12:21:01,571 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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-15 12:21:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:01,574 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2022-04-15 12:21:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2022-04-15 12:21:01,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:01,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:01,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 303 states. [2022-04-15 12:21:01,575 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 303 states. [2022-04-15 12:21:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:01,578 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2022-04-15 12:21:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2022-04-15 12:21:01,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:01,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:01,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:01,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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-15 12:21:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-15 12:21:01,580 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2022-04-15 12:21:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:01,580 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-15 12:21:01,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:01,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-15 12:21:01,809 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-15 12:21:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 12:21:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 12:21:01,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:01,810 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:01,828 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-15 12:21:02,010 WARN L460 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-15 12:21:02,011 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:02,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2052115343, now seen corresponding path program 97 times [2022-04-15 12:21:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:02,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868136314] [2022-04-15 12:21:02,017 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:02,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2052115343, now seen corresponding path program 98 times [2022-04-15 12:21:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:02,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289646793] [2022-04-15 12:21:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {63725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {63671#true} is VALID [2022-04-15 12:21:03,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 12:21:03,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 12:21:03,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {63671#true} call ULTIMATE.init(); {63725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:03,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {63725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {63671#true} is VALID [2022-04-15 12:21:03,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 12:21:03,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 12:21:03,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {63671#true} call #t~ret5 := main(); {63671#true} is VALID [2022-04-15 12:21:03,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {63671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63676#(= main_~i~0 0)} is VALID [2022-04-15 12:21:03,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {63676#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63676#(= main_~i~0 0)} is VALID [2022-04-15 12:21:03,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {63676#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:03,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {63677#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:03,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {63677#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:03,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {63678#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:03,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {63678#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:03,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {63679#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:03,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {63679#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:03,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {63680#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:03,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {63680#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:03,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {63681#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:03,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {63681#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:03,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {63682#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:03,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {63682#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:03,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {63683#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:03,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {63683#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:03,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {63684#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:03,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {63684#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:03,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {63685#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:03,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {63685#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:03,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {63686#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:03,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {63686#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:03,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {63687#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:03,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {63687#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:03,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {63688#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:03,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {63688#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:03,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {63689#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:03,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {63689#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:03,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {63690#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:03,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {63690#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:03,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {63691#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:03,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {63691#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:03,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {63692#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:03,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {63692#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:03,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {63693#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:03,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {63693#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:03,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {63694#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:03,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {63694#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:03,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {63695#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:03,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {63695#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:03,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {63696#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:03,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {63696#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:03,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {63697#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:03,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {63697#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:03,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {63698#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:03,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {63698#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:03,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {63699#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:03,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {63699#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:03,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {63700#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:03,117 INFO L290 TraceCheckUtils]: 55: Hoare triple {63700#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:03,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {63701#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:03,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {63701#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:03,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {63702#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:03,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {63702#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:03,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {63703#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:03,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {63703#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:03,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {63704#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:03,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {63704#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:03,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {63705#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:03,121 INFO L290 TraceCheckUtils]: 65: Hoare triple {63705#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:03,121 INFO L290 TraceCheckUtils]: 66: Hoare triple {63706#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:03,121 INFO L290 TraceCheckUtils]: 67: Hoare triple {63706#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:03,122 INFO L290 TraceCheckUtils]: 68: Hoare triple {63707#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:03,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {63707#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:03,122 INFO L290 TraceCheckUtils]: 70: Hoare triple {63708#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:03,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {63708#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:03,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {63709#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:03,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {63709#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:03,124 INFO L290 TraceCheckUtils]: 74: Hoare triple {63710#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:03,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {63710#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:03,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {63711#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:03,125 INFO L290 TraceCheckUtils]: 77: Hoare triple {63711#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:03,125 INFO L290 TraceCheckUtils]: 78: Hoare triple {63712#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:03,125 INFO L290 TraceCheckUtils]: 79: Hoare triple {63712#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:03,126 INFO L290 TraceCheckUtils]: 80: Hoare triple {63713#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:03,126 INFO L290 TraceCheckUtils]: 81: Hoare triple {63713#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:03,126 INFO L290 TraceCheckUtils]: 82: Hoare triple {63714#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:03,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {63714#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:03,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {63715#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:03,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {63715#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:03,128 INFO L290 TraceCheckUtils]: 86: Hoare triple {63716#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:03,128 INFO L290 TraceCheckUtils]: 87: Hoare triple {63716#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:03,129 INFO L290 TraceCheckUtils]: 88: Hoare triple {63717#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:03,130 INFO L290 TraceCheckUtils]: 89: Hoare triple {63717#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:03,130 INFO L290 TraceCheckUtils]: 90: Hoare triple {63718#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:03,130 INFO L290 TraceCheckUtils]: 91: Hoare triple {63718#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:03,130 INFO L290 TraceCheckUtils]: 92: Hoare triple {63719#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:03,131 INFO L290 TraceCheckUtils]: 93: Hoare triple {63719#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:03,131 INFO L290 TraceCheckUtils]: 94: Hoare triple {63720#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:03,132 INFO L290 TraceCheckUtils]: 95: Hoare triple {63720#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:03,132 INFO L290 TraceCheckUtils]: 96: Hoare triple {63721#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:03,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {63721#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:03,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {63722#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:03,133 INFO L290 TraceCheckUtils]: 99: Hoare triple {63722#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:03,133 INFO L290 TraceCheckUtils]: 100: Hoare triple {63723#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:03,133 INFO L290 TraceCheckUtils]: 101: Hoare triple {63723#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63724#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 102: Hoare triple {63724#(<= main_~i~0 48)} assume !(~i~0 < 1023); {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 103: Hoare triple {63672#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 104: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 105: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 107: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:03,134 INFO L290 TraceCheckUtils]: 111: Hoare triple {63672#false} assume !(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:03,135 INFO L272 TraceCheckUtils]: 112: Hoare triple {63672#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {63672#false} is VALID [2022-04-15 12:21:03,135 INFO L290 TraceCheckUtils]: 113: Hoare triple {63672#false} ~cond := #in~cond; {63672#false} is VALID [2022-04-15 12:21:03,135 INFO L290 TraceCheckUtils]: 114: Hoare triple {63672#false} assume 0 == ~cond; {63672#false} is VALID [2022-04-15 12:21:03,135 INFO L290 TraceCheckUtils]: 115: Hoare triple {63672#false} assume !false; {63672#false} is VALID [2022-04-15 12:21:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:03,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289646793] [2022-04-15 12:21:03,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289646793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:03,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089681671] [2022-04-15 12:21:03,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:21:03,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:03,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:03,137 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-15 12:21:03,138 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-15 12:21:03,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:21:03,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:03,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 12:21:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:04,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {63671#true} call ULTIMATE.init(); {63671#true} is VALID [2022-04-15 12:21:04,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {63671#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {63671#true} is VALID [2022-04-15 12:21:04,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 12:21:04,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 12:21:04,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {63671#true} call #t~ret5 := main(); {63671#true} is VALID [2022-04-15 12:21:04,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {63671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63744#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:04,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {63744#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63744#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:04,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {63744#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:04,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {63677#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:04,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {63677#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:04,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {63678#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:04,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {63678#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:04,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {63679#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:04,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {63679#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:04,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {63680#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:04,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {63680#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:04,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {63681#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:04,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {63681#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:04,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {63682#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:04,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {63682#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:04,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {63683#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:04,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {63683#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:04,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {63684#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:04,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {63684#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:04,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {63685#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:04,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {63685#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:04,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {63686#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:04,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {63686#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:04,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {63687#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:04,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {63687#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:04,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {63688#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:04,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {63688#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:04,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {63689#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:04,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {63689#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:04,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {63690#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:04,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {63690#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:04,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {63691#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:04,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {63691#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:04,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {63692#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:04,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {63692#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:04,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {63693#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:04,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {63693#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:04,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {63694#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:04,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {63694#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:04,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {63695#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:04,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {63695#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:04,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {63696#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:04,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {63696#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:04,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {63697#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:04,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {63697#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:04,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {63698#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:04,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {63698#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:04,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {63699#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:04,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {63699#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:04,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {63700#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:04,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {63700#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:04,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {63701#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:04,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {63701#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:04,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {63702#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:04,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {63702#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:04,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {63703#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:04,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {63703#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:04,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {63704#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:04,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {63704#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:04,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {63705#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:04,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {63705#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:04,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {63706#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:04,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {63706#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:04,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {63707#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:04,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {63707#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:04,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {63708#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:04,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {63708#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:04,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {63709#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:04,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {63709#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:04,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {63710#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:04,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {63710#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:04,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {63711#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:04,138 INFO L290 TraceCheckUtils]: 77: Hoare triple {63711#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:04,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {63712#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:04,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {63712#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:04,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {63713#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:04,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {63713#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:04,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {63714#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:04,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {63714#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:04,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {63715#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:04,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {63715#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:04,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {63716#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:04,142 INFO L290 TraceCheckUtils]: 87: Hoare triple {63716#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:04,142 INFO L290 TraceCheckUtils]: 88: Hoare triple {63717#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:04,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {63717#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:04,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {63718#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:04,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {63718#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:04,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {63719#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:04,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {63719#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:04,144 INFO L290 TraceCheckUtils]: 94: Hoare triple {63720#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:04,144 INFO L290 TraceCheckUtils]: 95: Hoare triple {63720#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:04,144 INFO L290 TraceCheckUtils]: 96: Hoare triple {63721#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:04,145 INFO L290 TraceCheckUtils]: 97: Hoare triple {63721#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:04,145 INFO L290 TraceCheckUtils]: 98: Hoare triple {63722#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:04,145 INFO L290 TraceCheckUtils]: 99: Hoare triple {63722#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:04,146 INFO L290 TraceCheckUtils]: 100: Hoare triple {63723#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:04,146 INFO L290 TraceCheckUtils]: 101: Hoare triple {63723#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63724#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:04,146 INFO L290 TraceCheckUtils]: 102: Hoare triple {63724#(<= main_~i~0 48)} assume !(~i~0 < 1023); {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 103: Hoare triple {63672#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 104: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 105: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 106: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 107: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 108: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 110: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 111: Hoare triple {63672#false} assume !(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L272 TraceCheckUtils]: 112: Hoare triple {63672#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 113: Hoare triple {63672#false} ~cond := #in~cond; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 114: Hoare triple {63672#false} assume 0 == ~cond; {63672#false} is VALID [2022-04-15 12:21:04,147 INFO L290 TraceCheckUtils]: 115: Hoare triple {63672#false} assume !false; {63672#false} is VALID [2022-04-15 12:21:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:04,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:06,981 INFO L290 TraceCheckUtils]: 115: Hoare triple {63672#false} assume !false; {63672#false} is VALID [2022-04-15 12:21:06,981 INFO L290 TraceCheckUtils]: 114: Hoare triple {63672#false} assume 0 == ~cond; {63672#false} is VALID [2022-04-15 12:21:06,981 INFO L290 TraceCheckUtils]: 113: Hoare triple {63672#false} ~cond := #in~cond; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L272 TraceCheckUtils]: 112: Hoare triple {63672#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 111: Hoare triple {63672#false} assume !(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 110: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 109: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 108: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 107: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 106: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 105: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 104: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 103: Hoare triple {63672#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {63672#false} is VALID [2022-04-15 12:21:06,982 INFO L290 TraceCheckUtils]: 102: Hoare triple {64114#(< main_~i~0 1023)} assume !(~i~0 < 1023); {63672#false} is VALID [2022-04-15 12:21:06,983 INFO L290 TraceCheckUtils]: 101: Hoare triple {64118#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64114#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:06,983 INFO L290 TraceCheckUtils]: 100: Hoare triple {64118#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64118#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:06,983 INFO L290 TraceCheckUtils]: 99: Hoare triple {64125#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64118#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:06,984 INFO L290 TraceCheckUtils]: 98: Hoare triple {64125#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64125#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:06,984 INFO L290 TraceCheckUtils]: 97: Hoare triple {64132#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64125#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:06,984 INFO L290 TraceCheckUtils]: 96: Hoare triple {64132#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64132#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:06,985 INFO L290 TraceCheckUtils]: 95: Hoare triple {64139#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64132#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:06,985 INFO L290 TraceCheckUtils]: 94: Hoare triple {64139#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64139#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:06,985 INFO L290 TraceCheckUtils]: 93: Hoare triple {64146#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64139#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:06,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {64146#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64146#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:06,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {64153#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64146#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:06,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {64153#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64153#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:06,987 INFO L290 TraceCheckUtils]: 89: Hoare triple {64160#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64153#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:06,987 INFO L290 TraceCheckUtils]: 88: Hoare triple {64160#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64160#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:06,987 INFO L290 TraceCheckUtils]: 87: Hoare triple {64167#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64160#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:06,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {64167#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64167#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:06,988 INFO L290 TraceCheckUtils]: 85: Hoare triple {64174#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64167#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:06,988 INFO L290 TraceCheckUtils]: 84: Hoare triple {64174#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64174#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:06,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {64181#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64174#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:06,989 INFO L290 TraceCheckUtils]: 82: Hoare triple {64181#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64181#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:06,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {64188#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64181#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:06,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {64188#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64188#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:06,990 INFO L290 TraceCheckUtils]: 79: Hoare triple {64195#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64188#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:06,990 INFO L290 TraceCheckUtils]: 78: Hoare triple {64195#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64195#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:06,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {64202#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64195#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:06,991 INFO L290 TraceCheckUtils]: 76: Hoare triple {64202#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64202#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:06,991 INFO L290 TraceCheckUtils]: 75: Hoare triple {64209#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64202#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:06,992 INFO L290 TraceCheckUtils]: 74: Hoare triple {64209#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64209#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:06,992 INFO L290 TraceCheckUtils]: 73: Hoare triple {64216#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64209#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:06,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {64216#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64216#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:06,993 INFO L290 TraceCheckUtils]: 71: Hoare triple {64223#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64216#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:06,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {64223#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64223#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:06,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {64230#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64223#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:06,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {64230#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64230#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:06,994 INFO L290 TraceCheckUtils]: 67: Hoare triple {64237#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64230#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:06,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {64237#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64237#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:06,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {64244#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64237#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:06,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {64244#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64244#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:06,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {64251#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64244#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:06,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {64251#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64251#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:06,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {64258#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64251#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:06,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {64258#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64258#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:06,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {64265#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64258#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:06,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {64265#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64265#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:06,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {64272#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64265#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:06,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {64272#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64272#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:06,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {64279#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64272#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:06,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {64279#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64279#(< main_~i~0 999)} is VALID [2022-04-15 12:21:06,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {64286#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64279#(< main_~i~0 999)} is VALID [2022-04-15 12:21:06,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {64286#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64286#(< main_~i~0 998)} is VALID [2022-04-15 12:21:06,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {64293#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64286#(< main_~i~0 998)} is VALID [2022-04-15 12:21:06,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {64293#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64293#(< main_~i~0 997)} is VALID [2022-04-15 12:21:07,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {64300#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64293#(< main_~i~0 997)} is VALID [2022-04-15 12:21:07,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {64300#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64300#(< main_~i~0 996)} is VALID [2022-04-15 12:21:07,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {64307#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64300#(< main_~i~0 996)} is VALID [2022-04-15 12:21:07,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {64307#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64307#(< main_~i~0 995)} is VALID [2022-04-15 12:21:07,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {64314#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64307#(< main_~i~0 995)} is VALID [2022-04-15 12:21:07,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {64314#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64314#(< main_~i~0 994)} is VALID [2022-04-15 12:21:07,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {64321#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64314#(< main_~i~0 994)} is VALID [2022-04-15 12:21:07,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {64321#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64321#(< main_~i~0 993)} is VALID [2022-04-15 12:21:07,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {64328#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64321#(< main_~i~0 993)} is VALID [2022-04-15 12:21:07,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {64328#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64328#(< main_~i~0 992)} is VALID [2022-04-15 12:21:07,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {64335#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64328#(< main_~i~0 992)} is VALID [2022-04-15 12:21:07,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {64335#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64335#(< main_~i~0 991)} is VALID [2022-04-15 12:21:07,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {64342#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64335#(< main_~i~0 991)} is VALID [2022-04-15 12:21:07,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {64342#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64342#(< main_~i~0 990)} is VALID [2022-04-15 12:21:07,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {64349#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64342#(< main_~i~0 990)} is VALID [2022-04-15 12:21:07,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {64349#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64349#(< main_~i~0 989)} is VALID [2022-04-15 12:21:07,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {64356#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64349#(< main_~i~0 989)} is VALID [2022-04-15 12:21:07,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {64356#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64356#(< main_~i~0 988)} is VALID [2022-04-15 12:21:07,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {64363#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64356#(< main_~i~0 988)} is VALID [2022-04-15 12:21:07,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {64363#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64363#(< main_~i~0 987)} is VALID [2022-04-15 12:21:07,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {64370#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64363#(< main_~i~0 987)} is VALID [2022-04-15 12:21:07,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {64370#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64370#(< main_~i~0 986)} is VALID [2022-04-15 12:21:07,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {64377#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64370#(< main_~i~0 986)} is VALID [2022-04-15 12:21:07,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {64377#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64377#(< main_~i~0 985)} is VALID [2022-04-15 12:21:07,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {64384#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64377#(< main_~i~0 985)} is VALID [2022-04-15 12:21:07,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {64384#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64384#(< main_~i~0 984)} is VALID [2022-04-15 12:21:07,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {64391#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64384#(< main_~i~0 984)} is VALID [2022-04-15 12:21:07,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {64391#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64391#(< main_~i~0 983)} is VALID [2022-04-15 12:21:07,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {64398#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64391#(< main_~i~0 983)} is VALID [2022-04-15 12:21:07,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {64398#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64398#(< main_~i~0 982)} is VALID [2022-04-15 12:21:07,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {64405#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64398#(< main_~i~0 982)} is VALID [2022-04-15 12:21:07,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {64405#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64405#(< main_~i~0 981)} is VALID [2022-04-15 12:21:07,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {64412#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64405#(< main_~i~0 981)} is VALID [2022-04-15 12:21:07,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {64412#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64412#(< main_~i~0 980)} is VALID [2022-04-15 12:21:07,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {64419#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64412#(< main_~i~0 980)} is VALID [2022-04-15 12:21:07,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {64419#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64419#(< main_~i~0 979)} is VALID [2022-04-15 12:21:07,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {64426#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64419#(< main_~i~0 979)} is VALID [2022-04-15 12:21:07,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {64426#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64426#(< main_~i~0 978)} is VALID [2022-04-15 12:21:07,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {64433#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64426#(< main_~i~0 978)} is VALID [2022-04-15 12:21:07,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {64433#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64433#(< main_~i~0 977)} is VALID [2022-04-15 12:21:07,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {64440#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64433#(< main_~i~0 977)} is VALID [2022-04-15 12:21:07,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {64440#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64440#(< main_~i~0 976)} is VALID [2022-04-15 12:21:07,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {64447#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64440#(< main_~i~0 976)} is VALID [2022-04-15 12:21:07,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {64447#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64447#(< main_~i~0 975)} is VALID [2022-04-15 12:21:07,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {63671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {64447#(< main_~i~0 975)} is VALID [2022-04-15 12:21:07,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {63671#true} call #t~ret5 := main(); {63671#true} is VALID [2022-04-15 12:21:07,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 12:21:07,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 12:21:07,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {63671#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {63671#true} is VALID [2022-04-15 12:21:07,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {63671#true} call ULTIMATE.init(); {63671#true} is VALID [2022-04-15 12:21:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:07,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089681671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:07,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:07,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-15 12:21:07,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:07,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868136314] [2022-04-15 12:21:07,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868136314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:07,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:07,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 12:21:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239002628] [2022-04-15 12:21:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 12:21:07,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:07,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:07,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:07,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 12:21:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:07,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 12:21:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 12:21:07,089 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:15,115 INFO L93 Difference]: Finished difference Result 323 states and 372 transitions. [2022-04-15 12:21:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 12:21:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 12:21:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 367 transitions. [2022-04-15 12:21:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 367 transitions. [2022-04-15 12:21:15,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 367 transitions. [2022-04-15 12:21:15,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:15,383 INFO L225 Difference]: With dead ends: 323 [2022-04-15 12:21:15,383 INFO L226 Difference]: Without dead ends: 309 [2022-04-15 12:21:15,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 12:21:15,385 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 761 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:15,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 41 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-15 12:21:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 119. [2022-04-15 12:21:16,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:16,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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-15 12:21:16,022 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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-15 12:21:16,022 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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-15 12:21:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:16,026 INFO L93 Difference]: Finished difference Result 309 states and 357 transitions. [2022-04-15 12:21:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 357 transitions. [2022-04-15 12:21:16,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:16,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:16,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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 309 states. [2022-04-15 12:21:16,026 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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 309 states. [2022-04-15 12:21:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:16,030 INFO L93 Difference]: Finished difference Result 309 states and 357 transitions. [2022-04-15 12:21:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 357 transitions. [2022-04-15 12:21:16,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:16,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:16,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:16,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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-15 12:21:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-15 12:21:16,031 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2022-04-15 12:21:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:16,031 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-15 12:21:16,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:16,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-15 12:21:16,255 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-15 12:21:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:21:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 12:21:16,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:16,256 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:16,273 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-15 12:21:16,456 WARN L460 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-15 12:21:16,457 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1069489487, now seen corresponding path program 99 times [2022-04-15 12:21:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420254496] [2022-04-15 12:21:16,461 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:16,461 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1069489487, now seen corresponding path program 100 times [2022-04-15 12:21:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:16,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517519747] [2022-04-15 12:21:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:17,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {66126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {66071#true} is VALID [2022-04-15 12:21:17,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 12:21:17,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 12:21:17,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {66071#true} call ULTIMATE.init(); {66126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:17,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {66126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {66071#true} is VALID [2022-04-15 12:21:17,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 12:21:17,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 12:21:17,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {66071#true} call #t~ret5 := main(); {66071#true} is VALID [2022-04-15 12:21:17,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {66071#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {66076#(= main_~i~0 0)} is VALID [2022-04-15 12:21:17,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {66076#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66076#(= main_~i~0 0)} is VALID [2022-04-15 12:21:17,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {66076#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:17,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {66077#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:17,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {66077#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:17,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {66078#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:17,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {66078#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:17,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {66079#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:17,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {66079#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:17,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {66080#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:17,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {66080#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:17,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {66081#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:17,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {66081#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:17,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {66082#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:17,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {66082#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:17,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {66083#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:17,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {66083#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:17,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {66084#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:17,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {66084#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:17,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {66085#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:17,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {66085#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:17,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {66086#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:17,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {66086#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:17,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {66087#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:17,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {66087#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:17,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {66088#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:17,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {66088#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:17,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {66089#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:17,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {66089#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:17,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {66090#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:17,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {66090#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:17,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {66091#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:17,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {66091#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:17,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {66092#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:17,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {66092#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:17,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {66093#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:17,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {66093#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:17,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {66094#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:17,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {66094#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:17,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {66095#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:17,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {66095#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:17,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {66096#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:17,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {66096#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:17,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {66097#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:17,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {66097#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:17,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {66098#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:17,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {66098#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:17,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {66099#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:17,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {66099#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:17,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {66100#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:17,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {66100#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:17,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {66101#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:17,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {66101#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:17,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {66102#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:17,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {66102#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:17,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {66103#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:17,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {66103#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:17,544 INFO L290 TraceCheckUtils]: 62: Hoare triple {66104#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:17,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {66104#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:17,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {66105#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:17,545 INFO L290 TraceCheckUtils]: 65: Hoare triple {66105#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:17,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {66106#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:17,546 INFO L290 TraceCheckUtils]: 67: Hoare triple {66106#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:17,546 INFO L290 TraceCheckUtils]: 68: Hoare triple {66107#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:17,547 INFO L290 TraceCheckUtils]: 69: Hoare triple {66107#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:17,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {66108#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:17,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {66108#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:17,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {66109#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:17,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {66109#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:17,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {66110#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:17,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {66110#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:17,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {66111#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:17,549 INFO L290 TraceCheckUtils]: 77: Hoare triple {66111#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:17,549 INFO L290 TraceCheckUtils]: 78: Hoare triple {66112#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:17,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {66112#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:17,550 INFO L290 TraceCheckUtils]: 80: Hoare triple {66113#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:17,550 INFO L290 TraceCheckUtils]: 81: Hoare triple {66113#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:17,551 INFO L290 TraceCheckUtils]: 82: Hoare triple {66114#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:17,551 INFO L290 TraceCheckUtils]: 83: Hoare triple {66114#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:17,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {66115#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:17,552 INFO L290 TraceCheckUtils]: 85: Hoare triple {66115#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:17,552 INFO L290 TraceCheckUtils]: 86: Hoare triple {66116#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:17,552 INFO L290 TraceCheckUtils]: 87: Hoare triple {66116#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:17,552 INFO L290 TraceCheckUtils]: 88: Hoare triple {66117#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:17,553 INFO L290 TraceCheckUtils]: 89: Hoare triple {66117#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:17,553 INFO L290 TraceCheckUtils]: 90: Hoare triple {66118#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:17,553 INFO L290 TraceCheckUtils]: 91: Hoare triple {66118#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:17,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {66119#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:17,554 INFO L290 TraceCheckUtils]: 93: Hoare triple {66119#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:17,554 INFO L290 TraceCheckUtils]: 94: Hoare triple {66120#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:17,555 INFO L290 TraceCheckUtils]: 95: Hoare triple {66120#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:17,555 INFO L290 TraceCheckUtils]: 96: Hoare triple {66121#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:17,555 INFO L290 TraceCheckUtils]: 97: Hoare triple {66121#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:17,556 INFO L290 TraceCheckUtils]: 98: Hoare triple {66122#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:17,556 INFO L290 TraceCheckUtils]: 99: Hoare triple {66122#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:17,556 INFO L290 TraceCheckUtils]: 100: Hoare triple {66123#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:17,557 INFO L290 TraceCheckUtils]: 101: Hoare triple {66123#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:17,557 INFO L290 TraceCheckUtils]: 102: Hoare triple {66124#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:17,557 INFO L290 TraceCheckUtils]: 103: Hoare triple {66124#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66125#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 104: Hoare triple {66125#(<= main_~i~0 49)} assume !(~i~0 < 1023); {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 105: Hoare triple {66072#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 106: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 107: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 108: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 109: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 110: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 111: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 112: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 113: Hoare triple {66072#false} assume !(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L272 TraceCheckUtils]: 114: Hoare triple {66072#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 115: Hoare triple {66072#false} ~cond := #in~cond; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 116: Hoare triple {66072#false} assume 0 == ~cond; {66072#false} is VALID [2022-04-15 12:21:17,558 INFO L290 TraceCheckUtils]: 117: Hoare triple {66072#false} assume !false; {66072#false} is VALID [2022-04-15 12:21:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517519747] [2022-04-15 12:21:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517519747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97893120] [2022-04-15 12:21:17,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:21:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:17,560 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-15 12:21:17,561 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-15 12:21:17,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:21:17,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:17,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:21:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:17,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:18,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {66071#true} call ULTIMATE.init(); {66071#true} is VALID [2022-04-15 12:21:18,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {66071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {66071#true} is VALID [2022-04-15 12:21:18,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 12:21:18,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 12:21:18,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {66071#true} call #t~ret5 := main(); {66071#true} is VALID [2022-04-15 12:21:18,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {66071#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {66145#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:18,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {66145#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66145#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:18,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {66145#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:18,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {66077#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:18,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {66077#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:18,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {66078#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:18,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {66078#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:18,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {66079#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:18,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {66079#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:18,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {66080#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:18,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {66080#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:18,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {66081#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:18,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {66081#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:18,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {66082#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:18,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {66082#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:18,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {66083#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:18,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {66083#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:18,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {66084#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:18,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {66084#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:18,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {66085#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:18,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {66085#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:18,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {66086#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:18,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {66086#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:18,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {66087#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:18,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {66087#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:18,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {66088#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:18,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {66088#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:18,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {66089#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:18,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {66089#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:18,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {66090#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:18,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {66090#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:18,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {66091#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:18,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {66091#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:18,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {66092#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:18,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {66092#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:18,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {66093#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:18,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {66093#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:18,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {66094#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:18,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {66094#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:18,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {66095#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:18,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {66095#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:18,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {66096#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:18,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {66096#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:18,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {66097#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:18,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {66097#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:18,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {66098#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:18,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {66098#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:18,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {66099#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:18,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {66099#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:18,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {66100#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:18,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {66100#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:18,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {66101#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:18,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {66101#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:18,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {66102#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:18,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {66102#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:18,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {66103#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:18,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {66103#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:18,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {66104#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:18,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {66104#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:18,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {66105#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:18,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {66105#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:18,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {66106#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:18,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {66106#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:18,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {66107#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:18,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {66107#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:18,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {66108#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:18,531 INFO L290 TraceCheckUtils]: 71: Hoare triple {66108#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:18,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {66109#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:18,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {66109#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:18,532 INFO L290 TraceCheckUtils]: 74: Hoare triple {66110#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:18,532 INFO L290 TraceCheckUtils]: 75: Hoare triple {66110#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:18,533 INFO L290 TraceCheckUtils]: 76: Hoare triple {66111#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:18,533 INFO L290 TraceCheckUtils]: 77: Hoare triple {66111#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:18,533 INFO L290 TraceCheckUtils]: 78: Hoare triple {66112#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:18,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {66112#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:18,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {66113#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:18,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {66113#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:18,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {66114#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:18,535 INFO L290 TraceCheckUtils]: 83: Hoare triple {66114#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:18,535 INFO L290 TraceCheckUtils]: 84: Hoare triple {66115#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:18,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {66115#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:18,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {66116#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:18,536 INFO L290 TraceCheckUtils]: 87: Hoare triple {66116#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:18,536 INFO L290 TraceCheckUtils]: 88: Hoare triple {66117#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:18,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {66117#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:18,537 INFO L290 TraceCheckUtils]: 90: Hoare triple {66118#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:18,537 INFO L290 TraceCheckUtils]: 91: Hoare triple {66118#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:18,538 INFO L290 TraceCheckUtils]: 92: Hoare triple {66119#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:18,538 INFO L290 TraceCheckUtils]: 93: Hoare triple {66119#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:18,538 INFO L290 TraceCheckUtils]: 94: Hoare triple {66120#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:18,539 INFO L290 TraceCheckUtils]: 95: Hoare triple {66120#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:18,539 INFO L290 TraceCheckUtils]: 96: Hoare triple {66121#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:18,539 INFO L290 TraceCheckUtils]: 97: Hoare triple {66121#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:18,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {66122#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:18,540 INFO L290 TraceCheckUtils]: 99: Hoare triple {66122#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:18,540 INFO L290 TraceCheckUtils]: 100: Hoare triple {66123#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:18,541 INFO L290 TraceCheckUtils]: 101: Hoare triple {66123#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:18,541 INFO L290 TraceCheckUtils]: 102: Hoare triple {66124#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:18,541 INFO L290 TraceCheckUtils]: 103: Hoare triple {66124#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66125#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 104: Hoare triple {66125#(<= main_~i~0 49)} assume !(~i~0 < 1023); {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 105: Hoare triple {66072#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 106: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 107: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 108: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 109: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 110: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 111: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 112: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 113: Hoare triple {66072#false} assume !(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L272 TraceCheckUtils]: 114: Hoare triple {66072#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 115: Hoare triple {66072#false} ~cond := #in~cond; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 116: Hoare triple {66072#false} assume 0 == ~cond; {66072#false} is VALID [2022-04-15 12:21:18,542 INFO L290 TraceCheckUtils]: 117: Hoare triple {66072#false} assume !false; {66072#false} is VALID [2022-04-15 12:21:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:18,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 117: Hoare triple {66072#false} assume !false; {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 116: Hoare triple {66072#false} assume 0 == ~cond; {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 115: Hoare triple {66072#false} ~cond := #in~cond; {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L272 TraceCheckUtils]: 114: Hoare triple {66072#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 113: Hoare triple {66072#false} assume !(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 112: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 111: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 12:21:21,612 INFO L290 TraceCheckUtils]: 110: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:21,613 INFO L290 TraceCheckUtils]: 109: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:21,613 INFO L290 TraceCheckUtils]: 108: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 12:21:21,613 INFO L290 TraceCheckUtils]: 107: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 12:21:21,613 INFO L290 TraceCheckUtils]: 106: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 12:21:21,613 INFO L290 TraceCheckUtils]: 105: Hoare triple {66072#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {66072#false} is VALID [2022-04-15 12:21:21,613 INFO L290 TraceCheckUtils]: 104: Hoare triple {66521#(< main_~i~0 1023)} assume !(~i~0 < 1023); {66072#false} is VALID [2022-04-15 12:21:21,614 INFO L290 TraceCheckUtils]: 103: Hoare triple {66525#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66521#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:21,614 INFO L290 TraceCheckUtils]: 102: Hoare triple {66525#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66525#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:21,614 INFO L290 TraceCheckUtils]: 101: Hoare triple {66532#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66525#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:21,614 INFO L290 TraceCheckUtils]: 100: Hoare triple {66532#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66532#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:21,615 INFO L290 TraceCheckUtils]: 99: Hoare triple {66539#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66532#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:21,615 INFO L290 TraceCheckUtils]: 98: Hoare triple {66539#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66539#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:21,615 INFO L290 TraceCheckUtils]: 97: Hoare triple {66546#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66539#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:21,616 INFO L290 TraceCheckUtils]: 96: Hoare triple {66546#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66546#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:21,616 INFO L290 TraceCheckUtils]: 95: Hoare triple {66553#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66546#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:21,616 INFO L290 TraceCheckUtils]: 94: Hoare triple {66553#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66553#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:21,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {66560#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66553#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:21,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {66560#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66560#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:21,617 INFO L290 TraceCheckUtils]: 91: Hoare triple {66567#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66560#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:21,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {66567#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66567#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:21,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {66574#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66567#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:21,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {66574#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66574#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:21,619 INFO L290 TraceCheckUtils]: 87: Hoare triple {66581#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66574#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:21,619 INFO L290 TraceCheckUtils]: 86: Hoare triple {66581#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66581#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:21,619 INFO L290 TraceCheckUtils]: 85: Hoare triple {66588#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66581#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:21,620 INFO L290 TraceCheckUtils]: 84: Hoare triple {66588#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66588#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:21,620 INFO L290 TraceCheckUtils]: 83: Hoare triple {66595#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66588#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:21,620 INFO L290 TraceCheckUtils]: 82: Hoare triple {66595#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66595#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:21,621 INFO L290 TraceCheckUtils]: 81: Hoare triple {66602#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66595#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:21,621 INFO L290 TraceCheckUtils]: 80: Hoare triple {66602#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66602#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:21,621 INFO L290 TraceCheckUtils]: 79: Hoare triple {66609#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66602#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:21,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {66609#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66609#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:21,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {66616#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66609#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:21,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {66616#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66616#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:21,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {66623#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66616#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:21,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {66623#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66623#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:21,623 INFO L290 TraceCheckUtils]: 73: Hoare triple {66630#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66623#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:21,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {66630#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66630#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:21,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {66637#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66630#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:21,624 INFO L290 TraceCheckUtils]: 70: Hoare triple {66637#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66637#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:21,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {66644#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66637#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:21,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {66644#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66644#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:21,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {66651#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66644#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:21,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {66651#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66651#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:21,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {66658#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66651#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:21,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {66658#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66658#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:21,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {66665#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66658#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:21,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {66665#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66665#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:21,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {66672#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66665#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:21,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {66672#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66672#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:21,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {66679#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66672#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:21,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {66679#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66679#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:21,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {66686#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66679#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:21,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {66686#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66686#(< main_~i~0 999)} is VALID [2022-04-15 12:21:21,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {66693#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66686#(< main_~i~0 999)} is VALID [2022-04-15 12:21:21,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {66693#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66693#(< main_~i~0 998)} is VALID [2022-04-15 12:21:21,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {66700#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66693#(< main_~i~0 998)} is VALID [2022-04-15 12:21:21,630 INFO L290 TraceCheckUtils]: 52: Hoare triple {66700#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66700#(< main_~i~0 997)} is VALID [2022-04-15 12:21:21,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {66707#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66700#(< main_~i~0 997)} is VALID [2022-04-15 12:21:21,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {66707#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66707#(< main_~i~0 996)} is VALID [2022-04-15 12:21:21,631 INFO L290 TraceCheckUtils]: 49: Hoare triple {66714#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66707#(< main_~i~0 996)} is VALID [2022-04-15 12:21:21,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {66714#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66714#(< main_~i~0 995)} is VALID [2022-04-15 12:21:21,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {66721#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66714#(< main_~i~0 995)} is VALID [2022-04-15 12:21:21,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {66721#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66721#(< main_~i~0 994)} is VALID [2022-04-15 12:21:21,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {66728#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66721#(< main_~i~0 994)} is VALID [2022-04-15 12:21:21,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {66728#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66728#(< main_~i~0 993)} is VALID [2022-04-15 12:21:21,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {66735#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66728#(< main_~i~0 993)} is VALID [2022-04-15 12:21:21,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {66735#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66735#(< main_~i~0 992)} is VALID [2022-04-15 12:21:21,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {66742#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66735#(< main_~i~0 992)} is VALID [2022-04-15 12:21:21,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {66742#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66742#(< main_~i~0 991)} is VALID [2022-04-15 12:21:21,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {66749#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66742#(< main_~i~0 991)} is VALID [2022-04-15 12:21:21,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {66749#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66749#(< main_~i~0 990)} is VALID [2022-04-15 12:21:21,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {66756#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66749#(< main_~i~0 990)} is VALID [2022-04-15 12:21:21,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {66756#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66756#(< main_~i~0 989)} is VALID [2022-04-15 12:21:21,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {66763#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66756#(< main_~i~0 989)} is VALID [2022-04-15 12:21:21,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {66763#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66763#(< main_~i~0 988)} is VALID [2022-04-15 12:21:21,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {66770#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66763#(< main_~i~0 988)} is VALID [2022-04-15 12:21:21,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {66770#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66770#(< main_~i~0 987)} is VALID [2022-04-15 12:21:21,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {66777#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66770#(< main_~i~0 987)} is VALID [2022-04-15 12:21:21,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {66777#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66777#(< main_~i~0 986)} is VALID [2022-04-15 12:21:21,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {66784#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66777#(< main_~i~0 986)} is VALID [2022-04-15 12:21:21,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {66784#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66784#(< main_~i~0 985)} is VALID [2022-04-15 12:21:21,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {66791#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66784#(< main_~i~0 985)} is VALID [2022-04-15 12:21:21,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {66791#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66791#(< main_~i~0 984)} is VALID [2022-04-15 12:21:21,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {66798#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66791#(< main_~i~0 984)} is VALID [2022-04-15 12:21:21,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {66798#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66798#(< main_~i~0 983)} is VALID [2022-04-15 12:21:21,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {66805#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66798#(< main_~i~0 983)} is VALID [2022-04-15 12:21:21,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {66805#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66805#(< main_~i~0 982)} is VALID [2022-04-15 12:21:21,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {66812#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66805#(< main_~i~0 982)} is VALID [2022-04-15 12:21:21,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {66812#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66812#(< main_~i~0 981)} is VALID [2022-04-15 12:21:21,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {66819#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66812#(< main_~i~0 981)} is VALID [2022-04-15 12:21:21,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {66819#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66819#(< main_~i~0 980)} is VALID [2022-04-15 12:21:21,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {66826#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66819#(< main_~i~0 980)} is VALID [2022-04-15 12:21:21,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {66826#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66826#(< main_~i~0 979)} is VALID [2022-04-15 12:21:21,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {66833#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66826#(< main_~i~0 979)} is VALID [2022-04-15 12:21:21,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {66833#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66833#(< main_~i~0 978)} is VALID [2022-04-15 12:21:21,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {66840#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66833#(< main_~i~0 978)} is VALID [2022-04-15 12:21:21,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {66840#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66840#(< main_~i~0 977)} is VALID [2022-04-15 12:21:21,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {66847#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66840#(< main_~i~0 977)} is VALID [2022-04-15 12:21:21,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {66847#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66847#(< main_~i~0 976)} is VALID [2022-04-15 12:21:21,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {66854#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66847#(< main_~i~0 976)} is VALID [2022-04-15 12:21:21,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {66854#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66854#(< main_~i~0 975)} is VALID [2022-04-15 12:21:21,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {66861#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66854#(< main_~i~0 975)} is VALID [2022-04-15 12:21:21,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {66861#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66861#(< main_~i~0 974)} is VALID [2022-04-15 12:21:21,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {66071#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {66861#(< main_~i~0 974)} is VALID [2022-04-15 12:21:21,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {66071#true} call #t~ret5 := main(); {66071#true} is VALID [2022-04-15 12:21:21,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 12:21:21,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 12:21:21,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {66071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {66071#true} is VALID [2022-04-15 12:21:21,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {66071#true} call ULTIMATE.init(); {66071#true} is VALID [2022-04-15 12:21:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:21,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97893120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:21,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:21,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 12:21:21,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:21,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420254496] [2022-04-15 12:21:21,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420254496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:21,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:21,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 12:21:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383023207] [2022-04-15 12:21:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:21,647 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 12:21:21,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:21,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:21,718 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-15 12:21:21,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 12:21:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 12:21:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 12:21:21,720 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:30,216 INFO L93 Difference]: Finished difference Result 329 states and 379 transitions. [2022-04-15 12:21:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 12:21:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 12:21:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 374 transitions. [2022-04-15 12:21:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 374 transitions. [2022-04-15 12:21:30,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 374 transitions. [2022-04-15 12:21:30,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:30,490 INFO L225 Difference]: With dead ends: 329 [2022-04-15 12:21:30,490 INFO L226 Difference]: Without dead ends: 315 [2022-04-15 12:21:30,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 12:21:30,492 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 696 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:30,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 41 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-15 12:21:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 121. [2022-04-15 12:21:31,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:31,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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-15 12:21:31,195 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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-15 12:21:31,195 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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-15 12:21:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:31,198 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2022-04-15 12:21:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 364 transitions. [2022-04-15 12:21:31,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:31,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:31,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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 315 states. [2022-04-15 12:21:31,199 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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 315 states. [2022-04-15 12:21:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:31,202 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2022-04-15 12:21:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 364 transitions. [2022-04-15 12:21:31,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:31,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:31,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:31,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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-15 12:21:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2022-04-15 12:21:31,204 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2022-04-15 12:21:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:31,204 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2022-04-15 12:21:31,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:31,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 122 transitions. [2022-04-15 12:21:31,460 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-15 12:21:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 12:21:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-15 12:21:31,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:31,460 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:31,480 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-15 12:21:31,661 WARN L460 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-15 12:21:31,661 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1250408787, now seen corresponding path program 101 times [2022-04-15 12:21:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902803660] [2022-04-15 12:21:31,667 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:31,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1250408787, now seen corresponding path program 102 times [2022-04-15 12:21:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:31,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310068117] [2022-04-15 12:21:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:32,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {68571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {68515#true} is VALID [2022-04-15 12:21:32,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 12:21:32,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 12:21:32,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {68515#true} call ULTIMATE.init(); {68571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:32,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {68571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {68515#true} is VALID [2022-04-15 12:21:32,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 12:21:32,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 12:21:32,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {68515#true} call #t~ret5 := main(); {68515#true} is VALID [2022-04-15 12:21:32,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {68515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {68520#(= main_~i~0 0)} is VALID [2022-04-15 12:21:32,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {68520#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68520#(= main_~i~0 0)} is VALID [2022-04-15 12:21:32,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {68520#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:32,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {68521#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:32,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {68521#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:32,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {68522#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:32,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {68522#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68523#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:32,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {68523#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68523#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:32,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {68523#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68524#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:32,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {68524#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68524#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:32,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {68524#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68525#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:32,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {68525#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68525#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:32,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {68525#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68526#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:32,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {68526#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68526#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:32,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {68526#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68527#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:32,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {68527#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68527#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:32,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {68527#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68528#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:32,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {68528#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68528#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:32,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {68528#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68529#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:32,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {68529#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68529#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:32,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {68529#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68530#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:32,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {68530#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68530#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:32,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {68530#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68531#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:32,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {68531#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68531#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:32,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {68531#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68532#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:32,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {68532#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68532#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:32,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {68532#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68533#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:32,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {68533#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68533#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:32,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {68533#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68534#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:32,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {68534#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68534#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:32,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {68534#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68535#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:32,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {68535#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68535#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:32,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {68535#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68536#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:32,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {68536#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68536#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:32,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {68536#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68537#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:32,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {68537#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68537#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:32,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {68537#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68538#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:32,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {68538#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68538#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:32,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {68538#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68539#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:32,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {68539#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68539#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:32,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {68539#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68540#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:32,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {68540#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68540#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:32,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {68540#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68541#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:32,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {68541#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68541#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:32,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {68541#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68542#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:32,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {68542#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68542#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:32,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {68542#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68543#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:32,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {68543#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68543#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:32,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {68543#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68544#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:32,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {68544#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68544#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:32,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {68544#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68545#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:32,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {68545#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68545#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:32,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {68545#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68546#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:32,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {68546#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68546#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:32,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {68546#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68547#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:32,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {68547#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68547#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:32,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {68547#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68548#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:32,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {68548#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68548#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:32,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {68548#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68549#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:32,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {68549#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68549#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:32,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {68549#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68550#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:32,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {68550#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68550#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:32,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {68550#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68551#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:32,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {68551#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68551#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:32,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {68551#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68552#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:32,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {68552#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68552#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:32,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {68552#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68553#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:32,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {68553#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68553#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:32,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {68553#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68554#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:32,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {68554#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68554#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:32,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {68554#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68555#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:32,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {68555#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68555#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:32,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {68555#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68556#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:32,828 INFO L290 TraceCheckUtils]: 78: Hoare triple {68556#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68556#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:32,829 INFO L290 TraceCheckUtils]: 79: Hoare triple {68556#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68557#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:32,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {68557#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68557#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:32,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {68557#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68558#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:32,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {68558#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68558#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:32,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {68558#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68559#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:32,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {68559#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68559#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:32,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {68559#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68560#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:32,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {68560#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68560#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:32,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {68560#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68561#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:32,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {68561#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68561#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:32,832 INFO L290 TraceCheckUtils]: 89: Hoare triple {68561#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68562#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:32,832 INFO L290 TraceCheckUtils]: 90: Hoare triple {68562#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68562#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:32,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {68562#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68563#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:32,833 INFO L290 TraceCheckUtils]: 92: Hoare triple {68563#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68563#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:32,833 INFO L290 TraceCheckUtils]: 93: Hoare triple {68563#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68564#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:32,833 INFO L290 TraceCheckUtils]: 94: Hoare triple {68564#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68564#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:32,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {68564#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68565#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:32,834 INFO L290 TraceCheckUtils]: 96: Hoare triple {68565#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68565#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:32,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {68565#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68566#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:32,835 INFO L290 TraceCheckUtils]: 98: Hoare triple {68566#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68566#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:32,835 INFO L290 TraceCheckUtils]: 99: Hoare triple {68566#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68567#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:32,835 INFO L290 TraceCheckUtils]: 100: Hoare triple {68567#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68567#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:32,836 INFO L290 TraceCheckUtils]: 101: Hoare triple {68567#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68568#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:32,836 INFO L290 TraceCheckUtils]: 102: Hoare triple {68568#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68568#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:32,836 INFO L290 TraceCheckUtils]: 103: Hoare triple {68568#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68569#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:32,837 INFO L290 TraceCheckUtils]: 104: Hoare triple {68569#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68569#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:32,837 INFO L290 TraceCheckUtils]: 105: Hoare triple {68569#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68570#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:32,837 INFO L290 TraceCheckUtils]: 106: Hoare triple {68570#(<= main_~i~0 50)} assume !(~i~0 < 1023); {68516#false} is VALID [2022-04-15 12:21:32,837 INFO L290 TraceCheckUtils]: 107: Hoare triple {68516#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {68516#false} is VALID [2022-04-15 12:21:32,837 INFO L290 TraceCheckUtils]: 108: Hoare triple {68516#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 109: Hoare triple {68516#false} assume !!(0 != #t~mem4);havoc #t~mem4; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 110: Hoare triple {68516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 111: Hoare triple {68516#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 112: Hoare triple {68516#false} assume !!(0 != #t~mem4);havoc #t~mem4; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 113: Hoare triple {68516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 114: Hoare triple {68516#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 115: Hoare triple {68516#false} assume !(0 != #t~mem4);havoc #t~mem4; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L272 TraceCheckUtils]: 116: Hoare triple {68516#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 117: Hoare triple {68516#false} ~cond := #in~cond; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 118: Hoare triple {68516#false} assume 0 == ~cond; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L290 TraceCheckUtils]: 119: Hoare triple {68516#false} assume !false; {68516#false} is VALID [2022-04-15 12:21:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310068117] [2022-04-15 12:21:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310068117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725027910] [2022-04-15 12:21:32,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:21:32,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:32,840 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-15 12:21:32,841 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-15 12:21:33,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:21:33,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:33,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:21:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:33,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:33,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {68515#true} call ULTIMATE.init(); {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {68515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {68515#true} call #t~ret5 := main(); {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {68515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 66: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 69: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 71: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 75: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 76: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 77: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 78: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 79: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 80: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 81: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 82: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 83: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 84: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 85: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 86: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 87: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,422 INFO L290 TraceCheckUtils]: 88: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 89: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 90: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 91: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 92: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 93: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 94: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 95: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 96: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 97: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 98: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 99: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 100: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 101: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 102: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,423 INFO L290 TraceCheckUtils]: 103: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,424 INFO L290 TraceCheckUtils]: 104: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,424 INFO L290 TraceCheckUtils]: 105: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,424 INFO L290 TraceCheckUtils]: 106: Hoare triple {68515#true} assume !(~i~0 < 1023); {68515#true} is VALID [2022-04-15 12:21:33,424 INFO L290 TraceCheckUtils]: 107: Hoare triple {68515#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {68896#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:33,424 INFO L290 TraceCheckUtils]: 108: Hoare triple {68896#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68896#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:33,425 INFO L290 TraceCheckUtils]: 109: Hoare triple {68896#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {68896#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:33,425 INFO L290 TraceCheckUtils]: 110: Hoare triple {68896#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:33,425 INFO L290 TraceCheckUtils]: 111: Hoare triple {68521#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68521#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:33,426 INFO L290 TraceCheckUtils]: 112: Hoare triple {68521#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:33,426 INFO L290 TraceCheckUtils]: 113: Hoare triple {68521#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:33,426 INFO L290 TraceCheckUtils]: 114: Hoare triple {68522#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68522#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:33,426 INFO L290 TraceCheckUtils]: 115: Hoare triple {68522#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:33,427 INFO L272 TraceCheckUtils]: 116: Hoare triple {68522#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:33,427 INFO L290 TraceCheckUtils]: 117: Hoare triple {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {68928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:33,428 INFO L290 TraceCheckUtils]: 118: Hoare triple {68928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {68516#false} is VALID [2022-04-15 12:21:33,428 INFO L290 TraceCheckUtils]: 119: Hoare triple {68516#false} assume !false; {68516#false} is VALID [2022-04-15 12:21:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 12:21:33,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:33,750 INFO L290 TraceCheckUtils]: 119: Hoare triple {68516#false} assume !false; {68516#false} is VALID [2022-04-15 12:21:33,751 INFO L290 TraceCheckUtils]: 118: Hoare triple {68928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {68516#false} is VALID [2022-04-15 12:21:33,751 INFO L290 TraceCheckUtils]: 117: Hoare triple {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {68928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:33,752 INFO L272 TraceCheckUtils]: 116: Hoare triple {68944#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:33,752 INFO L290 TraceCheckUtils]: 115: Hoare triple {68944#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {68944#(<= main_~i~0 1024)} is VALID [2022-04-15 12:21:33,752 INFO L290 TraceCheckUtils]: 114: Hoare triple {68944#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68944#(<= main_~i~0 1024)} is VALID [2022-04-15 12:21:33,753 INFO L290 TraceCheckUtils]: 113: Hoare triple {68954#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68944#(<= main_~i~0 1024)} is VALID [2022-04-15 12:21:33,753 INFO L290 TraceCheckUtils]: 112: Hoare triple {68954#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {68954#(<= main_~i~0 1023)} is VALID [2022-04-15 12:21:33,753 INFO L290 TraceCheckUtils]: 111: Hoare triple {68954#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68954#(<= main_~i~0 1023)} is VALID [2022-04-15 12:21:33,753 INFO L290 TraceCheckUtils]: 110: Hoare triple {68964#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68954#(<= main_~i~0 1023)} is VALID [2022-04-15 12:21:33,754 INFO L290 TraceCheckUtils]: 109: Hoare triple {68964#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {68964#(<= main_~i~0 1022)} is VALID [2022-04-15 12:21:33,754 INFO L290 TraceCheckUtils]: 108: Hoare triple {68964#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68964#(<= main_~i~0 1022)} is VALID [2022-04-15 12:21:33,754 INFO L290 TraceCheckUtils]: 107: Hoare triple {68515#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {68964#(<= main_~i~0 1022)} is VALID [2022-04-15 12:21:33,754 INFO L290 TraceCheckUtils]: 106: Hoare triple {68515#true} assume !(~i~0 < 1023); {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 105: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 104: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 103: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 102: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 101: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 100: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 99: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 98: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 97: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 96: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 95: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 94: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 93: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 90: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 89: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 88: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 87: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 86: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 85: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 84: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 82: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 81: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 75: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 74: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 73: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 71: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 70: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 69: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 68: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 67: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {68515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {68515#true} call #t~ret5 := main(); {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 12:21:33,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {68515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {68515#true} is VALID [2022-04-15 12:21:33,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {68515#true} call ULTIMATE.init(); {68515#true} is VALID [2022-04-15 12:21:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 12:21:33,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725027910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:33,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:33,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 7, 7] total 60 [2022-04-15 12:21:33,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:33,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902803660] [2022-04-15 12:21:33,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902803660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:33,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:33,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 12:21:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701067890] [2022-04-15 12:21:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:33,763 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-15 12:21:33,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:33,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:33,844 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-15 12:21:33,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 12:21:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:33,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 12:21:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=1938, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:21:33,845 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:42,640 INFO L93 Difference]: Finished difference Result 335 states and 386 transitions. [2022-04-15 12:21:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 12:21:42,641 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-15 12:21:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 381 transitions. [2022-04-15 12:21:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 381 transitions. [2022-04-15 12:21:42,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 381 transitions. [2022-04-15 12:21:42,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:42,921 INFO L225 Difference]: With dead ends: 335 [2022-04-15 12:21:42,921 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 12:21:42,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4510, Invalid=7700, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 12:21:42,922 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 874 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:42,922 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [874 Valid, 26 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 12:21:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 123. [2022-04-15 12:21:43,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:43,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 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-15 12:21:43,632 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 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-15 12:21:43,632 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 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-15 12:21:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:43,635 INFO L93 Difference]: Finished difference Result 321 states and 371 transitions. [2022-04-15 12:21:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 371 transitions. [2022-04-15 12:21:43,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:43,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:43,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 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 321 states. [2022-04-15 12:21:43,636 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 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 321 states. [2022-04-15 12:21:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:43,640 INFO L93 Difference]: Finished difference Result 321 states and 371 transitions. [2022-04-15 12:21:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 371 transitions. [2022-04-15 12:21:43,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:43,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:43,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:43,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 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-15 12:21:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-04-15 12:21:43,642 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2022-04-15 12:21:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:43,642 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-04-15 12:21:43,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:43,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 124 transitions. [2022-04-15 12:21:43,920 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-15 12:21:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2022-04-15 12:21:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 12:21:43,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:43,921 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:43,943 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-15 12:21:44,121 WARN L460 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-15 12:21:44,121 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:44,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1584623477, now seen corresponding path program 103 times [2022-04-15 12:21:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:44,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842001289] [2022-04-15 12:21:44,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:44,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1584623477, now seen corresponding path program 104 times [2022-04-15 12:21:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:44,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831041827] [2022-04-15 12:21:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:45,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:45,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {71014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {70957#true} is VALID [2022-04-15 12:21:45,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 12:21:45,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 12:21:45,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {70957#true} call ULTIMATE.init(); {71014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:45,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {71014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {70957#true} is VALID [2022-04-15 12:21:45,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 12:21:45,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 12:21:45,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {70957#true} call #t~ret5 := main(); {70957#true} is VALID [2022-04-15 12:21:45,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {70957#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70962#(= main_~i~0 0)} is VALID [2022-04-15 12:21:45,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {70962#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70962#(= main_~i~0 0)} is VALID [2022-04-15 12:21:45,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {70962#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:45,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {70963#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:45,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {70963#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:45,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {70964#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:45,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {70964#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:45,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {70965#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:45,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {70965#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:45,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {70966#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:45,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {70966#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:45,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {70967#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:45,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {70967#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:45,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {70968#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:45,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {70968#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:45,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {70969#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:45,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {70969#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:45,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {70970#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:45,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {70970#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:45,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {70971#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:45,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {70971#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:45,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {70972#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:45,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {70972#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:45,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {70973#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:45,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {70973#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:45,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {70974#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:45,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {70974#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:45,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {70975#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:45,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {70975#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:45,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {70976#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:45,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {70976#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:45,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {70977#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:45,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {70977#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:45,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {70978#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:45,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {70978#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:45,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {70979#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:45,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {70979#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:45,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {70980#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:45,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {70980#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:45,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {70981#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:45,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {70981#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:45,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {70982#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:45,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {70982#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:45,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {70983#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:45,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {70983#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:45,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {70984#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:45,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {70984#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:45,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {70985#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:45,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {70985#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:45,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {70986#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:45,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {70986#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:45,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {70987#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:45,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {70987#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:45,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {70988#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:45,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {70988#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:45,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {70989#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:45,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {70989#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:45,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {70990#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:45,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {70990#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:45,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {70991#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:45,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {70991#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:45,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {70992#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:45,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {70992#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:45,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {70993#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:45,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {70993#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:45,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {70994#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:45,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {70994#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:45,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {70995#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:45,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {70995#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:45,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {70996#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:45,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {70996#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:45,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {70997#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:45,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {70997#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:45,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {70998#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:45,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {70998#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:45,260 INFO L290 TraceCheckUtils]: 80: Hoare triple {70999#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:45,260 INFO L290 TraceCheckUtils]: 81: Hoare triple {70999#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:45,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {71000#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:45,261 INFO L290 TraceCheckUtils]: 83: Hoare triple {71000#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:45,261 INFO L290 TraceCheckUtils]: 84: Hoare triple {71001#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:45,261 INFO L290 TraceCheckUtils]: 85: Hoare triple {71001#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:45,262 INFO L290 TraceCheckUtils]: 86: Hoare triple {71002#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:45,262 INFO L290 TraceCheckUtils]: 87: Hoare triple {71002#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:45,262 INFO L290 TraceCheckUtils]: 88: Hoare triple {71003#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:45,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {71003#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:45,263 INFO L290 TraceCheckUtils]: 90: Hoare triple {71004#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:45,263 INFO L290 TraceCheckUtils]: 91: Hoare triple {71004#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:45,263 INFO L290 TraceCheckUtils]: 92: Hoare triple {71005#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:45,264 INFO L290 TraceCheckUtils]: 93: Hoare triple {71005#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:45,264 INFO L290 TraceCheckUtils]: 94: Hoare triple {71006#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:45,265 INFO L290 TraceCheckUtils]: 95: Hoare triple {71006#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:45,265 INFO L290 TraceCheckUtils]: 96: Hoare triple {71007#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:45,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {71007#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:45,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {71008#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:45,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {71008#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:45,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {71009#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:45,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {71009#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:45,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {71010#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:45,267 INFO L290 TraceCheckUtils]: 103: Hoare triple {71010#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:45,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {71011#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:45,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {71011#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:45,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {71012#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 107: Hoare triple {71012#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71013#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 108: Hoare triple {71013#(<= main_~i~0 51)} assume !(~i~0 < 1023); {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 109: Hoare triple {70958#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 110: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 111: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 112: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 113: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 114: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:45,269 INFO L290 TraceCheckUtils]: 115: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L290 TraceCheckUtils]: 116: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L290 TraceCheckUtils]: 117: Hoare triple {70958#false} assume !(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L272 TraceCheckUtils]: 118: Hoare triple {70958#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L290 TraceCheckUtils]: 119: Hoare triple {70958#false} ~cond := #in~cond; {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L290 TraceCheckUtils]: 120: Hoare triple {70958#false} assume 0 == ~cond; {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L290 TraceCheckUtils]: 121: Hoare triple {70958#false} assume !false; {70958#false} is VALID [2022-04-15 12:21:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831041827] [2022-04-15 12:21:45,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831041827] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709375132] [2022-04-15 12:21:45,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:21:45,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:45,272 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-15 12:21:45,272 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-15 12:21:45,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:21:45,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:45,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 12:21:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:45,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:46,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {70957#true} call ULTIMATE.init(); {70957#true} is VALID [2022-04-15 12:21:46,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {70957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {70957#true} is VALID [2022-04-15 12:21:46,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 12:21:46,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 12:21:46,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {70957#true} call #t~ret5 := main(); {70957#true} is VALID [2022-04-15 12:21:46,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {70957#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {71033#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:46,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {71033#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71033#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:46,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {71033#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:46,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {70963#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:46,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {70963#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:46,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {70964#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:46,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {70964#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:46,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {70965#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:46,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {70965#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:46,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {70966#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:46,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {70966#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:46,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {70967#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:46,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {70967#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:46,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {70968#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:46,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {70968#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:46,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {70969#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:46,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {70969#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:46,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {70970#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:46,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {70970#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:46,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {70971#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:46,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {70971#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:46,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {70972#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:46,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {70972#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:46,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {70973#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:46,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {70973#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:46,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {70974#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:46,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {70974#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:46,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {70975#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:46,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {70975#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:46,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {70976#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:46,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {70976#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:46,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {70977#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:46,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {70977#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:46,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {70978#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:46,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {70978#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:46,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {70979#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:46,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {70979#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:46,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {70980#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:46,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {70980#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:46,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {70981#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:46,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {70981#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:46,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {70982#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:46,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {70982#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:46,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {70983#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:46,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {70983#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:46,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {70984#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:46,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {70984#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:46,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {70985#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:46,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {70985#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:46,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {70986#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:46,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {70986#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:46,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {70987#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:46,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {70987#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:46,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {70988#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:46,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {70988#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:46,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {70989#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:46,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {70989#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:46,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {70990#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:46,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {70990#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:46,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {70991#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:46,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {70991#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:46,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {70992#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:46,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {70992#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:46,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {70993#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:46,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {70993#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:46,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {70994#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:46,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {70994#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:46,281 INFO L290 TraceCheckUtils]: 72: Hoare triple {70995#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:46,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {70995#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:46,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {70996#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:46,282 INFO L290 TraceCheckUtils]: 75: Hoare triple {70996#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:46,282 INFO L290 TraceCheckUtils]: 76: Hoare triple {70997#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:46,282 INFO L290 TraceCheckUtils]: 77: Hoare triple {70997#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:46,283 INFO L290 TraceCheckUtils]: 78: Hoare triple {70998#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:46,283 INFO L290 TraceCheckUtils]: 79: Hoare triple {70998#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:46,283 INFO L290 TraceCheckUtils]: 80: Hoare triple {70999#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:46,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {70999#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:46,284 INFO L290 TraceCheckUtils]: 82: Hoare triple {71000#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:46,284 INFO L290 TraceCheckUtils]: 83: Hoare triple {71000#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:46,285 INFO L290 TraceCheckUtils]: 84: Hoare triple {71001#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:46,285 INFO L290 TraceCheckUtils]: 85: Hoare triple {71001#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:46,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {71002#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:46,286 INFO L290 TraceCheckUtils]: 87: Hoare triple {71002#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:46,286 INFO L290 TraceCheckUtils]: 88: Hoare triple {71003#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:46,286 INFO L290 TraceCheckUtils]: 89: Hoare triple {71003#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:46,286 INFO L290 TraceCheckUtils]: 90: Hoare triple {71004#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:46,287 INFO L290 TraceCheckUtils]: 91: Hoare triple {71004#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:46,287 INFO L290 TraceCheckUtils]: 92: Hoare triple {71005#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:46,287 INFO L290 TraceCheckUtils]: 93: Hoare triple {71005#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:46,288 INFO L290 TraceCheckUtils]: 94: Hoare triple {71006#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:46,288 INFO L290 TraceCheckUtils]: 95: Hoare triple {71006#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:46,288 INFO L290 TraceCheckUtils]: 96: Hoare triple {71007#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:46,289 INFO L290 TraceCheckUtils]: 97: Hoare triple {71007#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:46,289 INFO L290 TraceCheckUtils]: 98: Hoare triple {71008#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:46,289 INFO L290 TraceCheckUtils]: 99: Hoare triple {71008#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:46,290 INFO L290 TraceCheckUtils]: 100: Hoare triple {71009#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:46,290 INFO L290 TraceCheckUtils]: 101: Hoare triple {71009#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:46,290 INFO L290 TraceCheckUtils]: 102: Hoare triple {71010#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:46,291 INFO L290 TraceCheckUtils]: 103: Hoare triple {71010#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:46,291 INFO L290 TraceCheckUtils]: 104: Hoare triple {71011#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:46,291 INFO L290 TraceCheckUtils]: 105: Hoare triple {71011#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:46,292 INFO L290 TraceCheckUtils]: 106: Hoare triple {71012#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:46,292 INFO L290 TraceCheckUtils]: 107: Hoare triple {71012#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71013#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:46,292 INFO L290 TraceCheckUtils]: 108: Hoare triple {71013#(<= main_~i~0 51)} assume !(~i~0 < 1023); {70958#false} is VALID [2022-04-15 12:21:46,292 INFO L290 TraceCheckUtils]: 109: Hoare triple {70958#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {70958#false} is VALID [2022-04-15 12:21:46,292 INFO L290 TraceCheckUtils]: 110: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 111: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 112: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 113: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 114: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 115: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 116: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 117: Hoare triple {70958#false} assume !(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L272 TraceCheckUtils]: 118: Hoare triple {70958#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 119: Hoare triple {70958#false} ~cond := #in~cond; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 120: Hoare triple {70958#false} assume 0 == ~cond; {70958#false} is VALID [2022-04-15 12:21:46,293 INFO L290 TraceCheckUtils]: 121: Hoare triple {70958#false} assume !false; {70958#false} is VALID [2022-04-15 12:21:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:46,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 121: Hoare triple {70958#false} assume !false; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 120: Hoare triple {70958#false} assume 0 == ~cond; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 119: Hoare triple {70958#false} ~cond := #in~cond; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L272 TraceCheckUtils]: 118: Hoare triple {70958#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 117: Hoare triple {70958#false} assume !(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 116: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 115: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 114: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 113: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 112: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 12:21:49,434 INFO L290 TraceCheckUtils]: 111: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 12:21:49,435 INFO L290 TraceCheckUtils]: 110: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 12:21:49,435 INFO L290 TraceCheckUtils]: 109: Hoare triple {70958#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {70958#false} is VALID [2022-04-15 12:21:49,435 INFO L290 TraceCheckUtils]: 108: Hoare triple {71421#(< main_~i~0 1023)} assume !(~i~0 < 1023); {70958#false} is VALID [2022-04-15 12:21:49,435 INFO L290 TraceCheckUtils]: 107: Hoare triple {71425#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71421#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:49,436 INFO L290 TraceCheckUtils]: 106: Hoare triple {71425#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71425#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:49,436 INFO L290 TraceCheckUtils]: 105: Hoare triple {71432#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71425#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:49,436 INFO L290 TraceCheckUtils]: 104: Hoare triple {71432#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71432#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:49,437 INFO L290 TraceCheckUtils]: 103: Hoare triple {71439#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71432#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:49,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {71439#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71439#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:49,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {71446#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71439#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:49,438 INFO L290 TraceCheckUtils]: 100: Hoare triple {71446#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71446#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:49,438 INFO L290 TraceCheckUtils]: 99: Hoare triple {71453#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71446#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:49,438 INFO L290 TraceCheckUtils]: 98: Hoare triple {71453#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71453#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:49,439 INFO L290 TraceCheckUtils]: 97: Hoare triple {71460#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71453#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:49,439 INFO L290 TraceCheckUtils]: 96: Hoare triple {71460#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71460#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:49,439 INFO L290 TraceCheckUtils]: 95: Hoare triple {71467#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71460#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:49,440 INFO L290 TraceCheckUtils]: 94: Hoare triple {71467#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71467#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:49,440 INFO L290 TraceCheckUtils]: 93: Hoare triple {71474#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71467#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:49,440 INFO L290 TraceCheckUtils]: 92: Hoare triple {71474#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71474#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:49,441 INFO L290 TraceCheckUtils]: 91: Hoare triple {71481#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71474#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:49,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {71481#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71481#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:49,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {71488#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71481#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:49,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {71488#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71488#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:49,442 INFO L290 TraceCheckUtils]: 87: Hoare triple {71495#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71488#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:49,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {71495#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71495#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:49,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {71502#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71495#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:49,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {71502#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71502#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:49,443 INFO L290 TraceCheckUtils]: 83: Hoare triple {71509#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71502#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:49,443 INFO L290 TraceCheckUtils]: 82: Hoare triple {71509#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71509#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:49,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {71516#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71509#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:49,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {71516#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71516#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:49,444 INFO L290 TraceCheckUtils]: 79: Hoare triple {71523#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71516#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:49,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {71523#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71523#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:49,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {71530#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71523#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:49,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {71530#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71530#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:49,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {71537#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71530#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:49,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {71537#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71537#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:49,447 INFO L290 TraceCheckUtils]: 73: Hoare triple {71544#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71537#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:49,447 INFO L290 TraceCheckUtils]: 72: Hoare triple {71544#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71544#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:49,447 INFO L290 TraceCheckUtils]: 71: Hoare triple {71551#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71544#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:49,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {71551#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71551#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:49,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {71558#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71551#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:49,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {71558#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71558#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:49,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {71565#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71558#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:49,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {71565#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71565#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:49,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {71572#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71565#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:49,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {71572#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71572#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:49,450 INFO L290 TraceCheckUtils]: 63: Hoare triple {71579#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71572#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:49,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {71579#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71579#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:49,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {71586#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71579#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:49,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {71586#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71586#(< main_~i~0 999)} is VALID [2022-04-15 12:21:49,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {71593#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71586#(< main_~i~0 999)} is VALID [2022-04-15 12:21:49,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {71593#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71593#(< main_~i~0 998)} is VALID [2022-04-15 12:21:49,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {71600#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71593#(< main_~i~0 998)} is VALID [2022-04-15 12:21:49,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {71600#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71600#(< main_~i~0 997)} is VALID [2022-04-15 12:21:49,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {71607#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71600#(< main_~i~0 997)} is VALID [2022-04-15 12:21:49,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {71607#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71607#(< main_~i~0 996)} is VALID [2022-04-15 12:21:49,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {71614#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71607#(< main_~i~0 996)} is VALID [2022-04-15 12:21:49,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {71614#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71614#(< main_~i~0 995)} is VALID [2022-04-15 12:21:49,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {71621#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71614#(< main_~i~0 995)} is VALID [2022-04-15 12:21:49,454 INFO L290 TraceCheckUtils]: 50: Hoare triple {71621#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71621#(< main_~i~0 994)} is VALID [2022-04-15 12:21:49,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {71628#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71621#(< main_~i~0 994)} is VALID [2022-04-15 12:21:49,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {71628#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71628#(< main_~i~0 993)} is VALID [2022-04-15 12:21:49,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {71635#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71628#(< main_~i~0 993)} is VALID [2022-04-15 12:21:49,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {71635#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71635#(< main_~i~0 992)} is VALID [2022-04-15 12:21:49,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {71642#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71635#(< main_~i~0 992)} is VALID [2022-04-15 12:21:49,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {71642#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71642#(< main_~i~0 991)} is VALID [2022-04-15 12:21:49,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {71649#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71642#(< main_~i~0 991)} is VALID [2022-04-15 12:21:49,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {71649#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71649#(< main_~i~0 990)} is VALID [2022-04-15 12:21:49,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {71656#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71649#(< main_~i~0 990)} is VALID [2022-04-15 12:21:49,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {71656#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71656#(< main_~i~0 989)} is VALID [2022-04-15 12:21:49,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {71663#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71656#(< main_~i~0 989)} is VALID [2022-04-15 12:21:49,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {71663#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71663#(< main_~i~0 988)} is VALID [2022-04-15 12:21:49,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {71670#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71663#(< main_~i~0 988)} is VALID [2022-04-15 12:21:49,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {71670#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71670#(< main_~i~0 987)} is VALID [2022-04-15 12:21:49,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {71677#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71670#(< main_~i~0 987)} is VALID [2022-04-15 12:21:49,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {71677#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71677#(< main_~i~0 986)} is VALID [2022-04-15 12:21:49,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {71684#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71677#(< main_~i~0 986)} is VALID [2022-04-15 12:21:49,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {71684#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71684#(< main_~i~0 985)} is VALID [2022-04-15 12:21:49,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {71691#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71684#(< main_~i~0 985)} is VALID [2022-04-15 12:21:49,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {71691#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71691#(< main_~i~0 984)} is VALID [2022-04-15 12:21:49,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {71698#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71691#(< main_~i~0 984)} is VALID [2022-04-15 12:21:49,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {71698#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71698#(< main_~i~0 983)} is VALID [2022-04-15 12:21:49,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {71705#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71698#(< main_~i~0 983)} is VALID [2022-04-15 12:21:49,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {71705#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71705#(< main_~i~0 982)} is VALID [2022-04-15 12:21:49,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {71712#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71705#(< main_~i~0 982)} is VALID [2022-04-15 12:21:49,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {71712#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71712#(< main_~i~0 981)} is VALID [2022-04-15 12:21:49,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {71719#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71712#(< main_~i~0 981)} is VALID [2022-04-15 12:21:49,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {71719#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71719#(< main_~i~0 980)} is VALID [2022-04-15 12:21:49,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {71726#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71719#(< main_~i~0 980)} is VALID [2022-04-15 12:21:49,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {71726#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71726#(< main_~i~0 979)} is VALID [2022-04-15 12:21:49,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {71733#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71726#(< main_~i~0 979)} is VALID [2022-04-15 12:21:49,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {71733#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71733#(< main_~i~0 978)} is VALID [2022-04-15 12:21:49,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {71740#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71733#(< main_~i~0 978)} is VALID [2022-04-15 12:21:49,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {71740#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71740#(< main_~i~0 977)} is VALID [2022-04-15 12:21:49,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {71747#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71740#(< main_~i~0 977)} is VALID [2022-04-15 12:21:49,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {71747#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71747#(< main_~i~0 976)} is VALID [2022-04-15 12:21:49,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {71754#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71747#(< main_~i~0 976)} is VALID [2022-04-15 12:21:49,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {71754#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71754#(< main_~i~0 975)} is VALID [2022-04-15 12:21:49,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {71761#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71754#(< main_~i~0 975)} is VALID [2022-04-15 12:21:49,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {71761#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71761#(< main_~i~0 974)} is VALID [2022-04-15 12:21:49,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {71768#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71761#(< main_~i~0 974)} is VALID [2022-04-15 12:21:49,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {71768#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71768#(< main_~i~0 973)} is VALID [2022-04-15 12:21:49,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {71775#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71768#(< main_~i~0 973)} is VALID [2022-04-15 12:21:49,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {71775#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71775#(< main_~i~0 972)} is VALID [2022-04-15 12:21:49,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {70957#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {71775#(< main_~i~0 972)} is VALID [2022-04-15 12:21:49,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {70957#true} call #t~ret5 := main(); {70957#true} is VALID [2022-04-15 12:21:49,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 12:21:49,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 12:21:49,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {70957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {70957#true} is VALID [2022-04-15 12:21:49,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {70957#true} call ULTIMATE.init(); {70957#true} is VALID [2022-04-15 12:21:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:21:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709375132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:49,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-15 12:21:49,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842001289] [2022-04-15 12:21:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842001289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:49,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 12:21:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680267024] [2022-04-15 12:21:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-15 12:21:49,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:49,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:49,545 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-15 12:21:49,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 12:21:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 12:21:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 12:21:49,547 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:58,828 INFO L93 Difference]: Finished difference Result 341 states and 393 transitions. [2022-04-15 12:21:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 12:21:58,828 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-15 12:21:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 388 transitions. [2022-04-15 12:21:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 388 transitions. [2022-04-15 12:21:58,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 388 transitions. [2022-04-15 12:21:59,102 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-15 12:21:59,107 INFO L225 Difference]: With dead ends: 341 [2022-04-15 12:21:59,107 INFO L226 Difference]: Without dead ends: 327 [2022-04-15 12:21:59,108 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 12:21:59,108 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 623 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:59,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 91 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-15 12:21:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 125. [2022-04-15 12:21:59,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:59,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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-15 12:21:59,814 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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-15 12:21:59,814 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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-15 12:21:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:59,818 INFO L93 Difference]: Finished difference Result 327 states and 378 transitions. [2022-04-15 12:21:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 378 transitions. [2022-04-15 12:21:59,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:59,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:59,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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 327 states. [2022-04-15 12:21:59,819 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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 327 states. [2022-04-15 12:21:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:59,822 INFO L93 Difference]: Finished difference Result 327 states and 378 transitions. [2022-04-15 12:21:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 378 transitions. [2022-04-15 12:21:59,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:59,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:59,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:59,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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-15 12:21:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2022-04-15 12:21:59,824 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2022-04-15 12:21:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:59,824 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2022-04-15 12:21:59,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:59,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 126 transitions. [2022-04-15 12:22:00,073 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-15 12:22:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 12:22:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 12:22:00,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:00,074 INFO L499 BasicCegarLoop]: trace histogram [52, 52, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:00,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-15 12:22:00,274 WARN L460 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-15 12:22:00,275 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:00,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 642393367, now seen corresponding path program 105 times [2022-04-15 12:22:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:00,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533693578] [2022-04-15 12:22:00,280 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:00,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 642393367, now seen corresponding path program 106 times [2022-04-15 12:22:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341850062] [2022-04-15 12:22:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:01,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {73547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {73489#true} is VALID [2022-04-15 12:22:01,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 12:22:01,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 12:22:01,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {73489#true} call ULTIMATE.init(); {73547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:01,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {73547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {73489#true} is VALID [2022-04-15 12:22:01,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 12:22:01,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 12:22:01,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {73489#true} call #t~ret5 := main(); {73489#true} is VALID [2022-04-15 12:22:01,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {73489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73494#(= main_~i~0 0)} is VALID [2022-04-15 12:22:01,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {73494#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73494#(= main_~i~0 0)} is VALID [2022-04-15 12:22:01,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {73494#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:01,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {73495#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:01,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {73495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:01,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {73496#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:01,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {73496#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:01,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {73497#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:01,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {73497#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:01,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {73498#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:01,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {73498#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:01,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {73499#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:01,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {73499#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:01,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {73500#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:01,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {73500#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:01,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {73501#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:01,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {73501#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:01,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {73502#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:01,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {73502#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:01,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {73503#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:01,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {73503#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:01,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {73504#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:01,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {73504#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:01,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {73505#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:01,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {73505#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:01,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {73506#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:01,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {73506#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:01,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {73507#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:01,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {73507#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:01,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {73508#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:01,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {73508#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:01,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {73509#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:01,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {73509#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:01,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {73510#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:01,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {73510#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:01,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {73511#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:01,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {73511#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:01,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {73512#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:01,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {73512#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:01,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {73513#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:01,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {73513#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:01,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {73514#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:01,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {73514#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:01,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {73515#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:01,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {73515#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:01,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {73516#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:01,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {73516#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:01,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {73517#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:01,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {73517#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:01,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {73518#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:01,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {73518#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:01,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {73519#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:01,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {73519#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:01,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {73520#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:01,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {73520#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:01,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {73521#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:01,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {73521#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:01,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {73522#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:01,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {73522#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:01,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {73523#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:01,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {73523#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:01,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {73524#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:01,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {73524#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:01,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {73525#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:01,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {73525#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:01,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {73526#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:01,379 INFO L290 TraceCheckUtils]: 71: Hoare triple {73526#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:01,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {73527#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:01,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {73527#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:01,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {73528#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:01,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {73528#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:01,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {73529#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:01,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {73529#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:01,381 INFO L290 TraceCheckUtils]: 78: Hoare triple {73530#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:01,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {73530#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:01,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {73531#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:01,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {73531#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:01,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {73532#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:01,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {73532#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:01,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {73533#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:01,384 INFO L290 TraceCheckUtils]: 85: Hoare triple {73533#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:01,384 INFO L290 TraceCheckUtils]: 86: Hoare triple {73534#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:01,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {73534#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:01,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {73535#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:01,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {73535#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:01,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {73536#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:01,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {73536#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:01,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {73537#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:01,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {73537#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:01,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {73538#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:01,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {73538#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:01,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {73539#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:01,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {73539#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:01,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {73540#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:01,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {73540#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:01,389 INFO L290 TraceCheckUtils]: 100: Hoare triple {73541#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:01,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {73541#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:01,389 INFO L290 TraceCheckUtils]: 102: Hoare triple {73542#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:01,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {73542#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:01,390 INFO L290 TraceCheckUtils]: 104: Hoare triple {73543#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:01,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {73543#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:01,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {73544#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:01,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {73544#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:01,391 INFO L290 TraceCheckUtils]: 108: Hoare triple {73545#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 109: Hoare triple {73545#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73546#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {73546#(<= main_~i~0 52)} assume !(~i~0 < 1023); {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {73490#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 113: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 114: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 115: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 116: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 117: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 12:22:01,392 INFO L290 TraceCheckUtils]: 118: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:01,393 INFO L290 TraceCheckUtils]: 119: Hoare triple {73490#false} assume !(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:01,393 INFO L272 TraceCheckUtils]: 120: Hoare triple {73490#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {73490#false} is VALID [2022-04-15 12:22:01,393 INFO L290 TraceCheckUtils]: 121: Hoare triple {73490#false} ~cond := #in~cond; {73490#false} is VALID [2022-04-15 12:22:01,393 INFO L290 TraceCheckUtils]: 122: Hoare triple {73490#false} assume 0 == ~cond; {73490#false} is VALID [2022-04-15 12:22:01,393 INFO L290 TraceCheckUtils]: 123: Hoare triple {73490#false} assume !false; {73490#false} is VALID [2022-04-15 12:22:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341850062] [2022-04-15 12:22:01,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341850062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623916436] [2022-04-15 12:22:01,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:22:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:01,395 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-15 12:22:01,395 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-15 12:22:01,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:22:01,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:01,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 12:22:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:01,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:02,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {73489#true} call ULTIMATE.init(); {73489#true} is VALID [2022-04-15 12:22:02,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {73489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {73489#true} is VALID [2022-04-15 12:22:02,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 12:22:02,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 12:22:02,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {73489#true} call #t~ret5 := main(); {73489#true} is VALID [2022-04-15 12:22:02,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {73489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73566#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:02,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {73566#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73566#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:02,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {73566#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:02,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {73495#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:02,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {73495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:02,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {73496#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:02,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {73496#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:02,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {73497#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:02,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {73497#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:02,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {73498#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:02,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {73498#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:02,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {73499#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:02,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {73499#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:02,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {73500#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:02,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {73500#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:02,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {73501#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:02,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {73501#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:02,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {73502#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:02,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {73502#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:02,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {73503#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:02,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {73503#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:02,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {73504#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:02,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {73504#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:02,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {73505#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:02,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {73505#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:02,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {73506#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:02,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {73506#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:02,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {73507#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:02,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {73507#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:02,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {73508#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:02,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {73508#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:02,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {73509#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:02,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {73509#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:02,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {73510#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:02,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {73510#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:02,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {73511#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:02,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {73511#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:02,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {73512#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:02,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {73512#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:02,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {73513#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:02,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {73513#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:02,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {73514#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:02,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {73514#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:02,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {73515#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:02,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {73515#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:02,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {73516#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:02,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {73516#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:02,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {73517#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:02,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {73517#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:02,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {73518#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:02,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {73518#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:02,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {73519#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:02,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {73519#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:02,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {73520#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:02,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {73520#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:02,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {73521#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:02,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {73521#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:02,452 INFO L290 TraceCheckUtils]: 62: Hoare triple {73522#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:02,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {73522#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:02,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {73523#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:02,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {73523#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:02,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {73524#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:02,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {73524#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:02,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {73525#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:02,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {73525#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:02,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {73526#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:02,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {73526#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:02,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {73527#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:02,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {73527#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:02,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {73528#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:02,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {73528#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:02,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {73529#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:02,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {73529#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:02,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {73530#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:02,458 INFO L290 TraceCheckUtils]: 79: Hoare triple {73530#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:02,458 INFO L290 TraceCheckUtils]: 80: Hoare triple {73531#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:02,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {73531#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:02,459 INFO L290 TraceCheckUtils]: 82: Hoare triple {73532#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:02,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {73532#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:02,459 INFO L290 TraceCheckUtils]: 84: Hoare triple {73533#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:02,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {73533#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:02,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {73534#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:02,460 INFO L290 TraceCheckUtils]: 87: Hoare triple {73534#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:02,461 INFO L290 TraceCheckUtils]: 88: Hoare triple {73535#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:02,461 INFO L290 TraceCheckUtils]: 89: Hoare triple {73535#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:02,461 INFO L290 TraceCheckUtils]: 90: Hoare triple {73536#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:02,462 INFO L290 TraceCheckUtils]: 91: Hoare triple {73536#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:02,462 INFO L290 TraceCheckUtils]: 92: Hoare triple {73537#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:02,462 INFO L290 TraceCheckUtils]: 93: Hoare triple {73537#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:02,463 INFO L290 TraceCheckUtils]: 94: Hoare triple {73538#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:02,463 INFO L290 TraceCheckUtils]: 95: Hoare triple {73538#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:02,463 INFO L290 TraceCheckUtils]: 96: Hoare triple {73539#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:02,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {73539#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:02,464 INFO L290 TraceCheckUtils]: 98: Hoare triple {73540#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:02,464 INFO L290 TraceCheckUtils]: 99: Hoare triple {73540#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:02,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {73541#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:02,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {73541#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:02,465 INFO L290 TraceCheckUtils]: 102: Hoare triple {73542#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:02,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {73542#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:02,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {73543#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:02,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {73543#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:02,467 INFO L290 TraceCheckUtils]: 106: Hoare triple {73544#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:02,467 INFO L290 TraceCheckUtils]: 107: Hoare triple {73544#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:02,467 INFO L290 TraceCheckUtils]: 108: Hoare triple {73545#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 109: Hoare triple {73545#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73546#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 110: Hoare triple {73546#(<= main_~i~0 52)} assume !(~i~0 < 1023); {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 111: Hoare triple {73490#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 112: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 114: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 115: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 116: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 117: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 12:22:02,468 INFO L290 TraceCheckUtils]: 118: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:02,469 INFO L290 TraceCheckUtils]: 119: Hoare triple {73490#false} assume !(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:02,469 INFO L272 TraceCheckUtils]: 120: Hoare triple {73490#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {73490#false} is VALID [2022-04-15 12:22:02,469 INFO L290 TraceCheckUtils]: 121: Hoare triple {73490#false} ~cond := #in~cond; {73490#false} is VALID [2022-04-15 12:22:02,469 INFO L290 TraceCheckUtils]: 122: Hoare triple {73490#false} assume 0 == ~cond; {73490#false} is VALID [2022-04-15 12:22:02,469 INFO L290 TraceCheckUtils]: 123: Hoare triple {73490#false} assume !false; {73490#false} is VALID [2022-04-15 12:22:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:02,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:05,711 INFO L290 TraceCheckUtils]: 123: Hoare triple {73490#false} assume !false; {73490#false} is VALID [2022-04-15 12:22:05,711 INFO L290 TraceCheckUtils]: 122: Hoare triple {73490#false} assume 0 == ~cond; {73490#false} is VALID [2022-04-15 12:22:05,711 INFO L290 TraceCheckUtils]: 121: Hoare triple {73490#false} ~cond := #in~cond; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L272 TraceCheckUtils]: 120: Hoare triple {73490#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 119: Hoare triple {73490#false} assume !(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 118: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 117: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 116: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 115: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 114: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 113: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 112: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 111: Hoare triple {73490#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {73490#false} is VALID [2022-04-15 12:22:05,712 INFO L290 TraceCheckUtils]: 110: Hoare triple {73960#(< main_~i~0 1023)} assume !(~i~0 < 1023); {73490#false} is VALID [2022-04-15 12:22:05,713 INFO L290 TraceCheckUtils]: 109: Hoare triple {73964#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73960#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:05,713 INFO L290 TraceCheckUtils]: 108: Hoare triple {73964#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73964#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:05,713 INFO L290 TraceCheckUtils]: 107: Hoare triple {73971#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73964#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:05,714 INFO L290 TraceCheckUtils]: 106: Hoare triple {73971#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73971#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:05,714 INFO L290 TraceCheckUtils]: 105: Hoare triple {73978#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73971#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:05,714 INFO L290 TraceCheckUtils]: 104: Hoare triple {73978#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73978#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:05,715 INFO L290 TraceCheckUtils]: 103: Hoare triple {73985#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73978#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:05,715 INFO L290 TraceCheckUtils]: 102: Hoare triple {73985#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73985#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:05,715 INFO L290 TraceCheckUtils]: 101: Hoare triple {73992#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73985#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:05,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {73992#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73992#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:05,716 INFO L290 TraceCheckUtils]: 99: Hoare triple {73999#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73992#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:05,716 INFO L290 TraceCheckUtils]: 98: Hoare triple {73999#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73999#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:05,717 INFO L290 TraceCheckUtils]: 97: Hoare triple {74006#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73999#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:05,717 INFO L290 TraceCheckUtils]: 96: Hoare triple {74006#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74006#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:05,717 INFO L290 TraceCheckUtils]: 95: Hoare triple {74013#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74006#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:05,718 INFO L290 TraceCheckUtils]: 94: Hoare triple {74013#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74013#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:05,718 INFO L290 TraceCheckUtils]: 93: Hoare triple {74020#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74013#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:05,718 INFO L290 TraceCheckUtils]: 92: Hoare triple {74020#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74020#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:05,719 INFO L290 TraceCheckUtils]: 91: Hoare triple {74027#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74020#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:05,719 INFO L290 TraceCheckUtils]: 90: Hoare triple {74027#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74027#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:05,719 INFO L290 TraceCheckUtils]: 89: Hoare triple {74034#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74027#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:05,719 INFO L290 TraceCheckUtils]: 88: Hoare triple {74034#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74034#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:05,720 INFO L290 TraceCheckUtils]: 87: Hoare triple {74041#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74034#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:05,720 INFO L290 TraceCheckUtils]: 86: Hoare triple {74041#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74041#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:05,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {74048#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74041#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:05,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {74048#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74048#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:05,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {74055#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74048#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:05,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {74055#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74055#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:05,722 INFO L290 TraceCheckUtils]: 81: Hoare triple {74062#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74055#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:05,722 INFO L290 TraceCheckUtils]: 80: Hoare triple {74062#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74062#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:05,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {74069#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74062#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:05,723 INFO L290 TraceCheckUtils]: 78: Hoare triple {74069#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74069#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:05,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {74076#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74069#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:05,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {74076#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74076#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:05,724 INFO L290 TraceCheckUtils]: 75: Hoare triple {74083#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74076#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:05,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {74083#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74083#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:05,724 INFO L290 TraceCheckUtils]: 73: Hoare triple {74090#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74083#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:05,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {74090#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74090#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:05,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {74097#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74090#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:05,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {74097#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74097#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:05,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {74104#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74097#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:05,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {74104#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74104#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:05,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {74111#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74104#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:05,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {74111#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74111#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:05,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {74118#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74111#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:05,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {74118#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74118#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:05,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {74125#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74118#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:05,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {74125#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74125#(< main_~i~0 999)} is VALID [2022-04-15 12:22:05,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {74132#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74125#(< main_~i~0 999)} is VALID [2022-04-15 12:22:05,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {74132#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74132#(< main_~i~0 998)} is VALID [2022-04-15 12:22:05,729 INFO L290 TraceCheckUtils]: 59: Hoare triple {74139#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74132#(< main_~i~0 998)} is VALID [2022-04-15 12:22:05,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {74139#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74139#(< main_~i~0 997)} is VALID [2022-04-15 12:22:05,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {74146#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74139#(< main_~i~0 997)} is VALID [2022-04-15 12:22:05,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {74146#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74146#(< main_~i~0 996)} is VALID [2022-04-15 12:22:05,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {74153#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74146#(< main_~i~0 996)} is VALID [2022-04-15 12:22:05,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {74153#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74153#(< main_~i~0 995)} is VALID [2022-04-15 12:22:05,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {74160#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74153#(< main_~i~0 995)} is VALID [2022-04-15 12:22:05,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {74160#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74160#(< main_~i~0 994)} is VALID [2022-04-15 12:22:05,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {74167#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74160#(< main_~i~0 994)} is VALID [2022-04-15 12:22:05,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {74167#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74167#(< main_~i~0 993)} is VALID [2022-04-15 12:22:05,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {74174#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74167#(< main_~i~0 993)} is VALID [2022-04-15 12:22:05,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {74174#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74174#(< main_~i~0 992)} is VALID [2022-04-15 12:22:05,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {74181#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74174#(< main_~i~0 992)} is VALID [2022-04-15 12:22:05,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {74181#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74181#(< main_~i~0 991)} is VALID [2022-04-15 12:22:05,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {74188#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74181#(< main_~i~0 991)} is VALID [2022-04-15 12:22:05,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {74188#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74188#(< main_~i~0 990)} is VALID [2022-04-15 12:22:05,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {74195#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74188#(< main_~i~0 990)} is VALID [2022-04-15 12:22:05,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {74195#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74195#(< main_~i~0 989)} is VALID [2022-04-15 12:22:05,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {74202#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74195#(< main_~i~0 989)} is VALID [2022-04-15 12:22:05,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {74202#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74202#(< main_~i~0 988)} is VALID [2022-04-15 12:22:05,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {74209#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74202#(< main_~i~0 988)} is VALID [2022-04-15 12:22:05,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {74209#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74209#(< main_~i~0 987)} is VALID [2022-04-15 12:22:05,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {74216#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74209#(< main_~i~0 987)} is VALID [2022-04-15 12:22:05,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {74216#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74216#(< main_~i~0 986)} is VALID [2022-04-15 12:22:05,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {74223#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74216#(< main_~i~0 986)} is VALID [2022-04-15 12:22:05,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {74223#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74223#(< main_~i~0 985)} is VALID [2022-04-15 12:22:05,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {74230#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74223#(< main_~i~0 985)} is VALID [2022-04-15 12:22:05,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {74230#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74230#(< main_~i~0 984)} is VALID [2022-04-15 12:22:05,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {74237#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74230#(< main_~i~0 984)} is VALID [2022-04-15 12:22:05,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {74237#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74237#(< main_~i~0 983)} is VALID [2022-04-15 12:22:05,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {74244#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74237#(< main_~i~0 983)} is VALID [2022-04-15 12:22:05,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {74244#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74244#(< main_~i~0 982)} is VALID [2022-04-15 12:22:05,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {74251#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74244#(< main_~i~0 982)} is VALID [2022-04-15 12:22:05,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {74251#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74251#(< main_~i~0 981)} is VALID [2022-04-15 12:22:05,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {74258#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74251#(< main_~i~0 981)} is VALID [2022-04-15 12:22:05,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {74258#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74258#(< main_~i~0 980)} is VALID [2022-04-15 12:22:05,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {74265#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74258#(< main_~i~0 980)} is VALID [2022-04-15 12:22:05,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {74265#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74265#(< main_~i~0 979)} is VALID [2022-04-15 12:22:05,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {74272#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74265#(< main_~i~0 979)} is VALID [2022-04-15 12:22:05,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {74272#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74272#(< main_~i~0 978)} is VALID [2022-04-15 12:22:05,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {74279#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74272#(< main_~i~0 978)} is VALID [2022-04-15 12:22:05,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {74279#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74279#(< main_~i~0 977)} is VALID [2022-04-15 12:22:05,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {74286#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74279#(< main_~i~0 977)} is VALID [2022-04-15 12:22:05,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {74286#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74286#(< main_~i~0 976)} is VALID [2022-04-15 12:22:05,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {74293#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74286#(< main_~i~0 976)} is VALID [2022-04-15 12:22:05,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {74293#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74293#(< main_~i~0 975)} is VALID [2022-04-15 12:22:05,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {74300#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74293#(< main_~i~0 975)} is VALID [2022-04-15 12:22:05,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {74300#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74300#(< main_~i~0 974)} is VALID [2022-04-15 12:22:05,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {74307#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74300#(< main_~i~0 974)} is VALID [2022-04-15 12:22:05,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {74307#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74307#(< main_~i~0 973)} is VALID [2022-04-15 12:22:05,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {74314#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74307#(< main_~i~0 973)} is VALID [2022-04-15 12:22:05,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {74314#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74314#(< main_~i~0 972)} is VALID [2022-04-15 12:22:05,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {74321#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74314#(< main_~i~0 972)} is VALID [2022-04-15 12:22:05,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {74321#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74321#(< main_~i~0 971)} is VALID [2022-04-15 12:22:05,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {73489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {74321#(< main_~i~0 971)} is VALID [2022-04-15 12:22:05,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {73489#true} call #t~ret5 := main(); {73489#true} is VALID [2022-04-15 12:22:05,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 12:22:05,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 12:22:05,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {73489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {73489#true} is VALID [2022-04-15 12:22:05,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {73489#true} call ULTIMATE.init(); {73489#true} is VALID [2022-04-15 12:22:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:05,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623916436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:05,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:05,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-15 12:22:05,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533693578] [2022-04-15 12:22:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533693578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:05,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 12:22:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400378091] [2022-04-15 12:22:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-15 12:22:05,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:05,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:05,825 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-15 12:22:05,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 12:22:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 12:22:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 12:22:05,826 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:15,595 INFO L93 Difference]: Finished difference Result 347 states and 400 transitions. [2022-04-15 12:22:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 12:22:15,595 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-15 12:22:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 395 transitions. [2022-04-15 12:22:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 395 transitions. [2022-04-15 12:22:15,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 395 transitions. [2022-04-15 12:22:15,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:15,883 INFO L225 Difference]: With dead ends: 347 [2022-04-15 12:22:15,884 INFO L226 Difference]: Without dead ends: 333 [2022-04-15 12:22:15,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 12:22:15,885 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 876 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:15,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [876 Valid, 41 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:22:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-15 12:22:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 127. [2022-04-15 12:22:16,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:16,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 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-15 12:22:16,660 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 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-15 12:22:16,661 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 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-15 12:22:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:16,665 INFO L93 Difference]: Finished difference Result 333 states and 385 transitions. [2022-04-15 12:22:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 385 transitions. [2022-04-15 12:22:16,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:16,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:16,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 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 333 states. [2022-04-15 12:22:16,666 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 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 333 states. [2022-04-15 12:22:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:16,672 INFO L93 Difference]: Finished difference Result 333 states and 385 transitions. [2022-04-15 12:22:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 385 transitions. [2022-04-15 12:22:16,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:16,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:16,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:16,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 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-15 12:22:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 12:22:16,674 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2022-04-15 12:22:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:16,674 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 12:22:16,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:16,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 12:22:16,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 12:22:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 12:22:16,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:16,930 INFO L499 BasicCegarLoop]: trace histogram [53, 53, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:16,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:17,131 WARN L460 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-15 12:22:17,131 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1397357113, now seen corresponding path program 107 times [2022-04-15 12:22:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:17,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557884218] [2022-04-15 12:22:17,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:17,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1397357113, now seen corresponding path program 108 times [2022-04-15 12:22:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:17,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710395293] [2022-04-15 12:22:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:18,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {76124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {76065#true} is VALID [2022-04-15 12:22:18,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 12:22:18,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 12:22:18,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {76065#true} call ULTIMATE.init(); {76124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:18,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {76124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {76065#true} is VALID [2022-04-15 12:22:18,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 12:22:18,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 12:22:18,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {76065#true} call #t~ret5 := main(); {76065#true} is VALID [2022-04-15 12:22:18,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {76065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {76070#(= main_~i~0 0)} is VALID [2022-04-15 12:22:18,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {76070#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76070#(= main_~i~0 0)} is VALID [2022-04-15 12:22:18,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {76070#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:18,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {76071#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:18,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {76071#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:18,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {76072#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:18,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {76072#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76073#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:18,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {76073#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76073#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:18,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {76073#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76074#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:18,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {76074#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76074#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:18,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {76074#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76075#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:18,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {76075#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76075#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:18,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {76075#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76076#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:18,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {76076#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76076#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:18,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {76076#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76077#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:18,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {76077#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76077#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:18,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {76077#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76078#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:18,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {76078#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76078#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:18,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {76078#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76079#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:18,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {76079#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76079#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:18,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {76079#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76080#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:18,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {76080#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76080#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:18,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {76080#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76081#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:18,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {76081#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76081#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:18,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {76081#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76082#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:18,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {76082#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76082#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:18,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {76082#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76083#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:18,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {76083#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76083#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:18,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {76083#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76084#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:18,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {76084#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76084#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:18,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {76084#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76085#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:18,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {76085#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76085#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:18,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {76085#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76086#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:18,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {76086#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76086#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:18,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {76086#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76087#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:18,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {76087#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76087#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:18,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {76087#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76088#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:18,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {76088#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76088#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:18,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {76088#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76089#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:18,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {76089#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76089#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:18,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {76089#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76090#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:18,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {76090#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76090#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:18,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {76090#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76091#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:18,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {76091#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76091#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:18,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {76091#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76092#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:18,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {76092#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76092#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:18,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {76092#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76093#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:18,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {76093#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76093#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:18,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {76093#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76094#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:18,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {76094#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76094#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:18,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {76094#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76095#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:18,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {76095#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76095#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:18,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {76095#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76096#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:18,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {76096#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76096#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:18,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {76096#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76097#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:18,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {76097#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76097#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:18,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {76097#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76098#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:18,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {76098#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76098#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:18,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {76098#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76099#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:18,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {76099#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76099#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:18,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {76099#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76100#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:18,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {76100#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76100#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:18,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {76100#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76101#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:18,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {76101#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76101#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:18,321 INFO L290 TraceCheckUtils]: 69: Hoare triple {76101#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76102#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:18,321 INFO L290 TraceCheckUtils]: 70: Hoare triple {76102#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76102#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:18,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {76102#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76103#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:18,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {76103#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76103#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:18,322 INFO L290 TraceCheckUtils]: 73: Hoare triple {76103#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76104#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:18,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {76104#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76104#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:18,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {76104#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76105#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:18,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {76105#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76105#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:18,324 INFO L290 TraceCheckUtils]: 77: Hoare triple {76105#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76106#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:18,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {76106#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76106#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:18,325 INFO L290 TraceCheckUtils]: 79: Hoare triple {76106#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76107#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:18,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {76107#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76107#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:18,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {76107#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76108#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:18,326 INFO L290 TraceCheckUtils]: 82: Hoare triple {76108#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76108#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:18,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {76108#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76109#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:18,327 INFO L290 TraceCheckUtils]: 84: Hoare triple {76109#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76109#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:18,327 INFO L290 TraceCheckUtils]: 85: Hoare triple {76109#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76110#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:18,328 INFO L290 TraceCheckUtils]: 86: Hoare triple {76110#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76110#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:18,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {76110#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76111#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:18,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {76111#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76111#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:18,329 INFO L290 TraceCheckUtils]: 89: Hoare triple {76111#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76112#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:18,329 INFO L290 TraceCheckUtils]: 90: Hoare triple {76112#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76112#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:18,330 INFO L290 TraceCheckUtils]: 91: Hoare triple {76112#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76113#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:18,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {76113#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76113#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:18,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {76113#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76114#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:18,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {76114#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76114#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:18,332 INFO L290 TraceCheckUtils]: 95: Hoare triple {76114#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76115#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:18,332 INFO L290 TraceCheckUtils]: 96: Hoare triple {76115#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76115#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:18,333 INFO L290 TraceCheckUtils]: 97: Hoare triple {76115#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76116#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:18,333 INFO L290 TraceCheckUtils]: 98: Hoare triple {76116#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76116#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:18,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {76116#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76117#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:18,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {76117#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76117#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:18,334 INFO L290 TraceCheckUtils]: 101: Hoare triple {76117#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76118#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:18,334 INFO L290 TraceCheckUtils]: 102: Hoare triple {76118#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76118#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:18,335 INFO L290 TraceCheckUtils]: 103: Hoare triple {76118#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76119#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:18,335 INFO L290 TraceCheckUtils]: 104: Hoare triple {76119#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76119#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:18,336 INFO L290 TraceCheckUtils]: 105: Hoare triple {76119#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76120#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:18,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {76120#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76120#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:18,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {76120#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76121#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:18,336 INFO L290 TraceCheckUtils]: 108: Hoare triple {76121#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76121#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:18,337 INFO L290 TraceCheckUtils]: 109: Hoare triple {76121#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76122#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:18,337 INFO L290 TraceCheckUtils]: 110: Hoare triple {76122#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76122#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:18,337 INFO L290 TraceCheckUtils]: 111: Hoare triple {76122#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76123#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 112: Hoare triple {76123#(<= main_~i~0 53)} assume !(~i~0 < 1023); {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 113: Hoare triple {76066#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 114: Hoare triple {76066#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 115: Hoare triple {76066#false} assume !!(0 != #t~mem4);havoc #t~mem4; {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {76066#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 117: Hoare triple {76066#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 118: Hoare triple {76066#false} assume !!(0 != #t~mem4);havoc #t~mem4; {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 119: Hoare triple {76066#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 120: Hoare triple {76066#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L290 TraceCheckUtils]: 121: Hoare triple {76066#false} assume !(0 != #t~mem4);havoc #t~mem4; {76066#false} is VALID [2022-04-15 12:22:18,338 INFO L272 TraceCheckUtils]: 122: Hoare triple {76066#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {76066#false} is VALID [2022-04-15 12:22:18,339 INFO L290 TraceCheckUtils]: 123: Hoare triple {76066#false} ~cond := #in~cond; {76066#false} is VALID [2022-04-15 12:22:18,339 INFO L290 TraceCheckUtils]: 124: Hoare triple {76066#false} assume 0 == ~cond; {76066#false} is VALID [2022-04-15 12:22:18,339 INFO L290 TraceCheckUtils]: 125: Hoare triple {76066#false} assume !false; {76066#false} is VALID [2022-04-15 12:22:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710395293] [2022-04-15 12:22:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710395293] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755814150] [2022-04-15 12:22:18,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:22:18,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:18,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:18,340 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-15 12:22:18,341 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-15 12:22:18,657 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:22:18,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:18,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:22:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:18,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:18,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {76065#true} call ULTIMATE.init(); {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {76065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {76065#true} call #t~ret5 := main(); {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {76065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,958 INFO L290 TraceCheckUtils]: 73: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 76: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 77: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 78: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 80: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 83: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 84: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 85: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 86: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 87: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,959 INFO L290 TraceCheckUtils]: 88: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 89: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 90: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 91: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 93: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 94: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 95: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 97: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 98: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 99: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 100: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 102: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,960 INFO L290 TraceCheckUtils]: 103: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 104: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 105: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 106: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 107: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 108: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 109: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 110: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 111: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 112: Hoare triple {76065#true} assume !(~i~0 < 1023); {76065#true} is VALID [2022-04-15 12:22:18,961 INFO L290 TraceCheckUtils]: 113: Hoare triple {76065#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {76467#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:18,962 INFO L290 TraceCheckUtils]: 114: Hoare triple {76467#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76467#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:18,962 INFO L290 TraceCheckUtils]: 115: Hoare triple {76467#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {76467#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:18,962 INFO L290 TraceCheckUtils]: 116: Hoare triple {76467#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:18,963 INFO L290 TraceCheckUtils]: 117: Hoare triple {76071#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76071#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:18,963 INFO L290 TraceCheckUtils]: 118: Hoare triple {76071#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:18,963 INFO L290 TraceCheckUtils]: 119: Hoare triple {76071#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:18,963 INFO L290 TraceCheckUtils]: 120: Hoare triple {76072#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76072#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:18,964 INFO L290 TraceCheckUtils]: 121: Hoare triple {76072#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:18,964 INFO L272 TraceCheckUtils]: 122: Hoare triple {76072#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:18,965 INFO L290 TraceCheckUtils]: 123: Hoare triple {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {76499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:22:18,965 INFO L290 TraceCheckUtils]: 124: Hoare triple {76499#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76066#false} is VALID [2022-04-15 12:22:18,965 INFO L290 TraceCheckUtils]: 125: Hoare triple {76066#false} assume !false; {76066#false} is VALID [2022-04-15 12:22:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 12:22:18,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:19,297 INFO L290 TraceCheckUtils]: 125: Hoare triple {76066#false} assume !false; {76066#false} is VALID [2022-04-15 12:22:19,297 INFO L290 TraceCheckUtils]: 124: Hoare triple {76499#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76066#false} is VALID [2022-04-15 12:22:19,298 INFO L290 TraceCheckUtils]: 123: Hoare triple {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {76499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:22:19,298 INFO L272 TraceCheckUtils]: 122: Hoare triple {76515#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:19,298 INFO L290 TraceCheckUtils]: 121: Hoare triple {76515#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {76515#(<= main_~i~0 1024)} is VALID [2022-04-15 12:22:19,299 INFO L290 TraceCheckUtils]: 120: Hoare triple {76515#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76515#(<= main_~i~0 1024)} is VALID [2022-04-15 12:22:19,299 INFO L290 TraceCheckUtils]: 119: Hoare triple {76525#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76515#(<= main_~i~0 1024)} is VALID [2022-04-15 12:22:19,299 INFO L290 TraceCheckUtils]: 118: Hoare triple {76525#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {76525#(<= main_~i~0 1023)} is VALID [2022-04-15 12:22:19,300 INFO L290 TraceCheckUtils]: 117: Hoare triple {76525#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76525#(<= main_~i~0 1023)} is VALID [2022-04-15 12:22:19,300 INFO L290 TraceCheckUtils]: 116: Hoare triple {76535#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76525#(<= main_~i~0 1023)} is VALID [2022-04-15 12:22:19,300 INFO L290 TraceCheckUtils]: 115: Hoare triple {76535#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {76535#(<= main_~i~0 1022)} is VALID [2022-04-15 12:22:19,300 INFO L290 TraceCheckUtils]: 114: Hoare triple {76535#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76535#(<= main_~i~0 1022)} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 113: Hoare triple {76065#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {76535#(<= main_~i~0 1022)} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 112: Hoare triple {76065#true} assume !(~i~0 < 1023); {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 111: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 110: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 109: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 107: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 106: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 105: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 103: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 102: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 101: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 99: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 98: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 97: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 96: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 95: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 94: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 93: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 92: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 91: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 90: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,302 INFO L290 TraceCheckUtils]: 89: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 83: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 79: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 77: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 76: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 75: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,303 INFO L290 TraceCheckUtils]: 74: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {76065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {76065#true} call #t~ret5 := main(); {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {76065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {76065#true} is VALID [2022-04-15 12:22:19,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {76065#true} call ULTIMATE.init(); {76065#true} is VALID [2022-04-15 12:22:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 12:22:19,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755814150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:19,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:19,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 63 [2022-04-15 12:22:19,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:19,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557884218] [2022-04-15 12:22:19,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557884218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:19,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:19,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 12:22:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378751301] [2022-04-15 12:22:19,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 12:22:19,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:19,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:19,388 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-15 12:22:19,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 12:22:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 12:22:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2130, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:22:19,389 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:29,532 INFO L93 Difference]: Finished difference Result 353 states and 407 transitions. [2022-04-15 12:22:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 12:22:29,532 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 12:22:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 402 transitions. [2022-04-15 12:22:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 402 transitions. [2022-04-15 12:22:29,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 402 transitions. [2022-04-15 12:22:29,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:29,824 INFO L225 Difference]: With dead ends: 353 [2022-04-15 12:22:29,825 INFO L226 Difference]: Without dead ends: 339 [2022-04-15 12:22:29,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5017, Invalid=8555, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 12:22:29,826 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 840 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:29,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 31 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:22:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-15 12:22:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 129. [2022-04-15 12:22:30,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:30,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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-15 12:22:30,613 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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-15 12:22:30,613 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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-15 12:22:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:30,617 INFO L93 Difference]: Finished difference Result 339 states and 392 transitions. [2022-04-15 12:22:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2022-04-15 12:22:30,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:30,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:30,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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 339 states. [2022-04-15 12:22:30,617 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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 339 states. [2022-04-15 12:22:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:30,621 INFO L93 Difference]: Finished difference Result 339 states and 392 transitions. [2022-04-15 12:22:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2022-04-15 12:22:30,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:30,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:30,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:30,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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-15 12:22:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-15 12:22:30,623 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2022-04-15 12:22:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:30,623 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-15 12:22:30,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:30,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-15 12:22:30,895 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-15 12:22:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 12:22:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 12:22:30,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:30,896 INFO L499 BasicCegarLoop]: trace histogram [54, 54, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:30,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:31,096 WARN L460 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-15 12:22:31,097 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1068043995, now seen corresponding path program 109 times [2022-04-15 12:22:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:31,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341896766] [2022-04-15 12:22:31,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:31,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1068043995, now seen corresponding path program 110 times [2022-04-15 12:22:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:31,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536318717] [2022-04-15 12:22:31,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:32,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {78696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {78636#true} is VALID [2022-04-15 12:22:32,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 12:22:32,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 12:22:32,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {78636#true} call ULTIMATE.init(); {78696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:32,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {78696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {78636#true} is VALID [2022-04-15 12:22:32,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 12:22:32,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 12:22:32,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {78636#true} call #t~ret5 := main(); {78636#true} is VALID [2022-04-15 12:22:32,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {78636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78641#(= main_~i~0 0)} is VALID [2022-04-15 12:22:32,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {78641#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78641#(= main_~i~0 0)} is VALID [2022-04-15 12:22:32,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {78641#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:32,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {78642#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:32,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {78642#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:32,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {78643#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:32,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {78643#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:32,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {78644#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:32,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {78644#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:32,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {78645#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 12:22:32,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {78645#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:32,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {78646#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:32,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {78646#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:32,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {78647#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:32,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {78647#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:32,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {78648#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:32,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {78648#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:32,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {78649#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:32,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {78649#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:32,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {78650#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:32,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {78650#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:32,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {78651#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:32,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {78651#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:32,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {78652#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -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 11)} is VALID [2022-04-15 12:22:32,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {78652#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:32,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {78653#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:32,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {78653#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:32,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {78654#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:32,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {78654#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:32,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {78655#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:32,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {78655#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:32,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {78656#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:32,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {78656#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:32,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {78657#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:32,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {78657#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:32,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {78658#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {78658#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {78659#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -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 18)} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {78659#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {78660#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {78660#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {78661#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {78661#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {78662#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {78662#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:32,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {78663#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {78663#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {78664#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {78664#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {78665#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {78665#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {78666#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -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 25)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {78666#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {78667#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:32,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {78667#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:32,301 INFO L290 TraceCheckUtils]: 60: Hoare triple {78668#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:32,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {78668#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:32,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {78669#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:32,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {78669#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:32,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {78670#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:32,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {78670#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {78671#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 67: Hoare triple {78671#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:32,303 INFO L290 TraceCheckUtils]: 68: Hoare triple {78672#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {78672#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {78673#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -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 32)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {78673#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:32,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {78674#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:32,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {78674#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:32,305 INFO L290 TraceCheckUtils]: 74: Hoare triple {78675#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:32,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {78675#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {78676#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {78676#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:32,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {78677#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:32,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {78677#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:32,307 INFO L290 TraceCheckUtils]: 80: Hoare triple {78678#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:32,307 INFO L290 TraceCheckUtils]: 81: Hoare triple {78678#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:32,308 INFO L290 TraceCheckUtils]: 82: Hoare triple {78679#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:32,308 INFO L290 TraceCheckUtils]: 83: Hoare triple {78679#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:32,308 INFO L290 TraceCheckUtils]: 84: Hoare triple {78680#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -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 39)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {78680#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {78681#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:32,309 INFO L290 TraceCheckUtils]: 87: Hoare triple {78681#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:32,310 INFO L290 TraceCheckUtils]: 88: Hoare triple {78682#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:32,310 INFO L290 TraceCheckUtils]: 89: Hoare triple {78682#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:32,310 INFO L290 TraceCheckUtils]: 90: Hoare triple {78683#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:32,311 INFO L290 TraceCheckUtils]: 91: Hoare triple {78683#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:32,311 INFO L290 TraceCheckUtils]: 92: Hoare triple {78684#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:32,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {78684#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 94: Hoare triple {78685#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 95: Hoare triple {78685#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:32,312 INFO L290 TraceCheckUtils]: 96: Hoare triple {78686#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 97: Hoare triple {78686#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 98: Hoare triple {78687#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -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 46)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 99: Hoare triple {78687#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:32,313 INFO L290 TraceCheckUtils]: 100: Hoare triple {78688#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:32,314 INFO L290 TraceCheckUtils]: 101: Hoare triple {78688#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:32,314 INFO L290 TraceCheckUtils]: 102: Hoare triple {78689#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:32,314 INFO L290 TraceCheckUtils]: 103: Hoare triple {78689#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:32,315 INFO L290 TraceCheckUtils]: 104: Hoare triple {78690#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:32,315 INFO L290 TraceCheckUtils]: 105: Hoare triple {78690#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:32,315 INFO L290 TraceCheckUtils]: 106: Hoare triple {78691#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:32,316 INFO L290 TraceCheckUtils]: 107: Hoare triple {78691#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:32,316 INFO L290 TraceCheckUtils]: 108: Hoare triple {78692#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:32,316 INFO L290 TraceCheckUtils]: 109: Hoare triple {78692#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:32,317 INFO L290 TraceCheckUtils]: 110: Hoare triple {78693#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:32,317 INFO L290 TraceCheckUtils]: 111: Hoare triple {78693#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:32,317 INFO L290 TraceCheckUtils]: 112: Hoare triple {78694#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -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 53)} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 113: Hoare triple {78694#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78695#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 114: Hoare triple {78695#(<= main_~i~0 54)} assume !(~i~0 < 1023); {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 115: Hoare triple {78637#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 116: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 117: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 118: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 119: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 120: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:32,318 INFO L290 TraceCheckUtils]: 121: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L290 TraceCheckUtils]: 122: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L290 TraceCheckUtils]: 123: Hoare triple {78637#false} assume !(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L272 TraceCheckUtils]: 124: Hoare triple {78637#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L290 TraceCheckUtils]: 125: Hoare triple {78637#false} ~cond := #in~cond; {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L290 TraceCheckUtils]: 126: Hoare triple {78637#false} assume 0 == ~cond; {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L290 TraceCheckUtils]: 127: Hoare triple {78637#false} assume !false; {78637#false} is VALID [2022-04-15 12:22:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:32,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536318717] [2022-04-15 12:22:32,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536318717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:32,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429320933] [2022-04-15 12:22:32,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:22:32,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:32,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:32,321 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-15 12:22:32,322 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-15 12:22:32,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:22:32,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:32,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 12:22:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:32,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:33,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {78636#true} call ULTIMATE.init(); {78636#true} is VALID [2022-04-15 12:22:33,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {78636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {78636#true} is VALID [2022-04-15 12:22:33,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 12:22:33,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 12:22:33,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {78636#true} call #t~ret5 := main(); {78636#true} is VALID [2022-04-15 12:22:33,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {78636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78715#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:33,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {78715#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -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 0)} is VALID [2022-04-15 12:22:33,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {78715#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:33,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {78642#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:33,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {78642#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:33,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {78643#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:33,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {78643#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:33,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {78644#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:33,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {78644#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:33,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {78645#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 12:22:33,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {78645#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:33,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {78646#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:33,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {78646#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:33,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {78647#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:33,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {78647#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:33,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {78648#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:33,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {78648#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:33,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {78649#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:33,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {78649#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:33,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {78650#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:33,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {78650#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:33,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {78651#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:33,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {78651#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:33,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {78652#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -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 11)} is VALID [2022-04-15 12:22:33,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {78652#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:33,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {78653#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:33,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {78653#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:33,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {78654#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:33,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {78654#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:33,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {78655#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:33,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {78655#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:33,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {78656#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:33,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {78656#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:33,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {78657#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:33,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {78657#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:33,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {78658#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:33,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {78658#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:33,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {78659#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -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 18)} is VALID [2022-04-15 12:22:33,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {78659#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:33,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {78660#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:33,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {78660#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:33,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {78661#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:33,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {78661#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:33,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {78662#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:33,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {78662#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:33,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {78663#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:33,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {78663#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:33,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {78664#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:33,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {78664#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:33,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {78665#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:33,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {78665#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:33,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {78666#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -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 25)} is VALID [2022-04-15 12:22:33,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {78666#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:33,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {78667#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:33,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {78667#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:33,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {78668#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:33,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {78668#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:33,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {78669#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:33,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {78669#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:33,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {78670#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:33,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {78670#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:33,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {78671#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:33,450 INFO L290 TraceCheckUtils]: 67: Hoare triple {78671#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:33,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {78672#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:33,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {78672#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:33,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {78673#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -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 32)} is VALID [2022-04-15 12:22:33,451 INFO L290 TraceCheckUtils]: 71: Hoare triple {78673#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:33,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {78674#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:33,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {78674#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:33,452 INFO L290 TraceCheckUtils]: 74: Hoare triple {78675#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:33,452 INFO L290 TraceCheckUtils]: 75: Hoare triple {78675#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:33,452 INFO L290 TraceCheckUtils]: 76: Hoare triple {78676#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:33,453 INFO L290 TraceCheckUtils]: 77: Hoare triple {78676#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:33,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {78677#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:33,453 INFO L290 TraceCheckUtils]: 79: Hoare triple {78677#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:33,454 INFO L290 TraceCheckUtils]: 80: Hoare triple {78678#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:33,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {78678#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:33,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {78679#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:33,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {78679#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:33,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {78680#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -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 39)} is VALID [2022-04-15 12:22:33,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {78680#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:33,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {78681#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:33,456 INFO L290 TraceCheckUtils]: 87: Hoare triple {78681#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:33,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {78682#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:33,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {78682#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:33,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {78683#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:33,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {78683#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:33,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {78684#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:33,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {78684#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:33,458 INFO L290 TraceCheckUtils]: 94: Hoare triple {78685#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:33,459 INFO L290 TraceCheckUtils]: 95: Hoare triple {78685#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:33,459 INFO L290 TraceCheckUtils]: 96: Hoare triple {78686#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:33,459 INFO L290 TraceCheckUtils]: 97: Hoare triple {78686#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:33,460 INFO L290 TraceCheckUtils]: 98: Hoare triple {78687#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -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 46)} is VALID [2022-04-15 12:22:33,460 INFO L290 TraceCheckUtils]: 99: Hoare triple {78687#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:33,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {78688#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:33,461 INFO L290 TraceCheckUtils]: 101: Hoare triple {78688#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:33,461 INFO L290 TraceCheckUtils]: 102: Hoare triple {78689#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:33,461 INFO L290 TraceCheckUtils]: 103: Hoare triple {78689#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:33,461 INFO L290 TraceCheckUtils]: 104: Hoare triple {78690#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:33,462 INFO L290 TraceCheckUtils]: 105: Hoare triple {78690#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:33,462 INFO L290 TraceCheckUtils]: 106: Hoare triple {78691#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:33,462 INFO L290 TraceCheckUtils]: 107: Hoare triple {78691#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:33,463 INFO L290 TraceCheckUtils]: 108: Hoare triple {78692#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:33,463 INFO L290 TraceCheckUtils]: 109: Hoare triple {78692#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:33,463 INFO L290 TraceCheckUtils]: 110: Hoare triple {78693#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:33,464 INFO L290 TraceCheckUtils]: 111: Hoare triple {78693#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:33,464 INFO L290 TraceCheckUtils]: 112: Hoare triple {78694#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -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 53)} is VALID [2022-04-15 12:22:33,464 INFO L290 TraceCheckUtils]: 113: Hoare triple {78694#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78695#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 114: Hoare triple {78695#(<= main_~i~0 54)} assume !(~i~0 < 1023); {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 115: Hoare triple {78637#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 116: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 117: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 118: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 119: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 120: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 121: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 122: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 123: Hoare triple {78637#false} assume !(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L272 TraceCheckUtils]: 124: Hoare triple {78637#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {78637#false} is VALID [2022-04-15 12:22:33,465 INFO L290 TraceCheckUtils]: 125: Hoare triple {78637#false} ~cond := #in~cond; {78637#false} is VALID [2022-04-15 12:22:33,466 INFO L290 TraceCheckUtils]: 126: Hoare triple {78637#false} assume 0 == ~cond; {78637#false} is VALID [2022-04-15 12:22:33,466 INFO L290 TraceCheckUtils]: 127: Hoare triple {78637#false} assume !false; {78637#false} is VALID [2022-04-15 12:22:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:33,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 127: Hoare triple {78637#false} assume !false; {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 126: Hoare triple {78637#false} assume 0 == ~cond; {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 125: Hoare triple {78637#false} ~cond := #in~cond; {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L272 TraceCheckUtils]: 124: Hoare triple {78637#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 123: Hoare triple {78637#false} assume !(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 122: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 121: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 12:22:37,005 INFO L290 TraceCheckUtils]: 120: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:37,006 INFO L290 TraceCheckUtils]: 119: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:37,006 INFO L290 TraceCheckUtils]: 118: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 12:22:37,006 INFO L290 TraceCheckUtils]: 117: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 12:22:37,006 INFO L290 TraceCheckUtils]: 116: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 12:22:37,006 INFO L290 TraceCheckUtils]: 115: Hoare triple {78637#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {78637#false} is VALID [2022-04-15 12:22:37,006 INFO L290 TraceCheckUtils]: 114: Hoare triple {79121#(< main_~i~0 1023)} assume !(~i~0 < 1023); {78637#false} is VALID [2022-04-15 12:22:37,007 INFO L290 TraceCheckUtils]: 113: Hoare triple {79125#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79121#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:37,007 INFO L290 TraceCheckUtils]: 112: Hoare triple {79125#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79125#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:37,007 INFO L290 TraceCheckUtils]: 111: Hoare triple {79132#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79125#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:37,007 INFO L290 TraceCheckUtils]: 110: Hoare triple {79132#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79132#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:37,008 INFO L290 TraceCheckUtils]: 109: Hoare triple {79139#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79132#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:37,008 INFO L290 TraceCheckUtils]: 108: Hoare triple {79139#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79139#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:37,009 INFO L290 TraceCheckUtils]: 107: Hoare triple {79146#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79139#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:37,009 INFO L290 TraceCheckUtils]: 106: Hoare triple {79146#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79146#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:37,009 INFO L290 TraceCheckUtils]: 105: Hoare triple {79153#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79146#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:37,009 INFO L290 TraceCheckUtils]: 104: Hoare triple {79153#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79153#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:37,010 INFO L290 TraceCheckUtils]: 103: Hoare triple {79160#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79153#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:37,010 INFO L290 TraceCheckUtils]: 102: Hoare triple {79160#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79160#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:37,011 INFO L290 TraceCheckUtils]: 101: Hoare triple {79167#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79160#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:37,011 INFO L290 TraceCheckUtils]: 100: Hoare triple {79167#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79167#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:37,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {79174#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79167#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:37,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {79174#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79174#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:37,012 INFO L290 TraceCheckUtils]: 97: Hoare triple {79181#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79174#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:37,012 INFO L290 TraceCheckUtils]: 96: Hoare triple {79181#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79181#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:37,013 INFO L290 TraceCheckUtils]: 95: Hoare triple {79188#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79181#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:37,013 INFO L290 TraceCheckUtils]: 94: Hoare triple {79188#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79188#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:37,013 INFO L290 TraceCheckUtils]: 93: Hoare triple {79195#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79188#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:37,013 INFO L290 TraceCheckUtils]: 92: Hoare triple {79195#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79195#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:37,014 INFO L290 TraceCheckUtils]: 91: Hoare triple {79202#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79195#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:37,014 INFO L290 TraceCheckUtils]: 90: Hoare triple {79202#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79202#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:37,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {79209#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79202#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:37,015 INFO L290 TraceCheckUtils]: 88: Hoare triple {79209#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79209#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:37,015 INFO L290 TraceCheckUtils]: 87: Hoare triple {79216#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79209#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:37,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {79216#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79216#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:37,016 INFO L290 TraceCheckUtils]: 85: Hoare triple {79223#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79216#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:37,016 INFO L290 TraceCheckUtils]: 84: Hoare triple {79223#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79223#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:37,017 INFO L290 TraceCheckUtils]: 83: Hoare triple {79230#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79223#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:37,017 INFO L290 TraceCheckUtils]: 82: Hoare triple {79230#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79230#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:37,017 INFO L290 TraceCheckUtils]: 81: Hoare triple {79237#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79230#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:37,017 INFO L290 TraceCheckUtils]: 80: Hoare triple {79237#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79237#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:37,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {79244#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79237#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:37,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {79244#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79244#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:37,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {79251#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79244#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:37,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {79251#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79251#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:37,019 INFO L290 TraceCheckUtils]: 75: Hoare triple {79258#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79251#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:37,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {79258#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79258#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:37,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {79265#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79258#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:37,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {79265#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79265#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:37,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {79272#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79265#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:37,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {79272#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79272#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:37,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {79279#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79272#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:37,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {79279#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79279#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:37,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {79286#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79279#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:37,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {79286#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79286#(< main_~i~0 999)} is VALID [2022-04-15 12:22:37,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {79293#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79286#(< main_~i~0 999)} is VALID [2022-04-15 12:22:37,023 INFO L290 TraceCheckUtils]: 64: Hoare triple {79293#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79293#(< main_~i~0 998)} is VALID [2022-04-15 12:22:37,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {79300#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79293#(< main_~i~0 998)} is VALID [2022-04-15 12:22:37,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {79300#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79300#(< main_~i~0 997)} is VALID [2022-04-15 12:22:37,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {79307#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79300#(< main_~i~0 997)} is VALID [2022-04-15 12:22:37,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {79307#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79307#(< main_~i~0 996)} is VALID [2022-04-15 12:22:37,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {79314#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79307#(< main_~i~0 996)} is VALID [2022-04-15 12:22:37,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {79314#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79314#(< main_~i~0 995)} is VALID [2022-04-15 12:22:37,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {79321#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79314#(< main_~i~0 995)} is VALID [2022-04-15 12:22:37,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {79321#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79321#(< main_~i~0 994)} is VALID [2022-04-15 12:22:37,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {79328#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79321#(< main_~i~0 994)} is VALID [2022-04-15 12:22:37,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {79328#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79328#(< main_~i~0 993)} is VALID [2022-04-15 12:22:37,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {79335#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79328#(< main_~i~0 993)} is VALID [2022-04-15 12:22:37,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {79335#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79335#(< main_~i~0 992)} is VALID [2022-04-15 12:22:37,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {79342#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79335#(< main_~i~0 992)} is VALID [2022-04-15 12:22:37,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {79342#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79342#(< main_~i~0 991)} is VALID [2022-04-15 12:22:37,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {79349#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79342#(< main_~i~0 991)} is VALID [2022-04-15 12:22:37,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {79349#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79349#(< main_~i~0 990)} is VALID [2022-04-15 12:22:37,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {79356#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79349#(< main_~i~0 990)} is VALID [2022-04-15 12:22:37,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {79356#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79356#(< main_~i~0 989)} is VALID [2022-04-15 12:22:37,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {79363#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79356#(< main_~i~0 989)} is VALID [2022-04-15 12:22:37,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {79363#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79363#(< main_~i~0 988)} is VALID [2022-04-15 12:22:37,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {79370#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79363#(< main_~i~0 988)} is VALID [2022-04-15 12:22:37,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {79370#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79370#(< main_~i~0 987)} is VALID [2022-04-15 12:22:37,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {79377#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79370#(< main_~i~0 987)} is VALID [2022-04-15 12:22:37,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {79377#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79377#(< main_~i~0 986)} is VALID [2022-04-15 12:22:37,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {79384#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79377#(< main_~i~0 986)} is VALID [2022-04-15 12:22:37,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {79384#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79384#(< main_~i~0 985)} is VALID [2022-04-15 12:22:37,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {79391#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79384#(< main_~i~0 985)} is VALID [2022-04-15 12:22:37,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {79391#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79391#(< main_~i~0 984)} is VALID [2022-04-15 12:22:37,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {79398#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79391#(< main_~i~0 984)} is VALID [2022-04-15 12:22:37,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {79398#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79398#(< main_~i~0 983)} is VALID [2022-04-15 12:22:37,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {79405#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79398#(< main_~i~0 983)} is VALID [2022-04-15 12:22:37,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {79405#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79405#(< main_~i~0 982)} is VALID [2022-04-15 12:22:37,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {79412#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79405#(< main_~i~0 982)} is VALID [2022-04-15 12:22:37,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {79412#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79412#(< main_~i~0 981)} is VALID [2022-04-15 12:22:37,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {79419#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79412#(< main_~i~0 981)} is VALID [2022-04-15 12:22:37,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {79419#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79419#(< main_~i~0 980)} is VALID [2022-04-15 12:22:37,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {79426#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79419#(< main_~i~0 980)} is VALID [2022-04-15 12:22:37,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {79426#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79426#(< main_~i~0 979)} is VALID [2022-04-15 12:22:37,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {79433#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79426#(< main_~i~0 979)} is VALID [2022-04-15 12:22:37,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {79433#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79433#(< main_~i~0 978)} is VALID [2022-04-15 12:22:37,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {79440#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79433#(< main_~i~0 978)} is VALID [2022-04-15 12:22:37,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {79440#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79440#(< main_~i~0 977)} is VALID [2022-04-15 12:22:37,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {79447#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79440#(< main_~i~0 977)} is VALID [2022-04-15 12:22:37,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {79447#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79447#(< main_~i~0 976)} is VALID [2022-04-15 12:22:37,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {79454#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79447#(< main_~i~0 976)} is VALID [2022-04-15 12:22:37,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {79454#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79454#(< main_~i~0 975)} is VALID [2022-04-15 12:22:37,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {79461#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79454#(< main_~i~0 975)} is VALID [2022-04-15 12:22:37,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {79461#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79461#(< main_~i~0 974)} is VALID [2022-04-15 12:22:37,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {79468#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79461#(< main_~i~0 974)} is VALID [2022-04-15 12:22:37,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {79468#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79468#(< main_~i~0 973)} is VALID [2022-04-15 12:22:37,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {79475#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79468#(< main_~i~0 973)} is VALID [2022-04-15 12:22:37,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {79475#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79475#(< main_~i~0 972)} is VALID [2022-04-15 12:22:37,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {79482#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79475#(< main_~i~0 972)} is VALID [2022-04-15 12:22:37,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {79482#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79482#(< main_~i~0 971)} is VALID [2022-04-15 12:22:37,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {79489#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79482#(< main_~i~0 971)} is VALID [2022-04-15 12:22:37,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {79489#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79489#(< main_~i~0 970)} is VALID [2022-04-15 12:22:37,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {79496#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79489#(< main_~i~0 970)} is VALID [2022-04-15 12:22:37,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {79496#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79496#(< main_~i~0 969)} is VALID [2022-04-15 12:22:37,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {78636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {79496#(< main_~i~0 969)} is VALID [2022-04-15 12:22:37,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {78636#true} call #t~ret5 := main(); {78636#true} is VALID [2022-04-15 12:22:37,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 12:22:37,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 12:22:37,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {78636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {78636#true} is VALID [2022-04-15 12:22:37,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {78636#true} call ULTIMATE.init(); {78636#true} is VALID [2022-04-15 12:22:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:37,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429320933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:37,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:37,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-15 12:22:37,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:37,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341896766] [2022-04-15 12:22:37,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341896766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:37,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:37,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 12:22:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665476676] [2022-04-15 12:22:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-15 12:22:37,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:37,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:37,127 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-15 12:22:37,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 12:22:37,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 12:22:37,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 12:22:37,129 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:47,836 INFO L93 Difference]: Finished difference Result 359 states and 414 transitions. [2022-04-15 12:22:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 12:22:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-15 12:22:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 409 transitions. [2022-04-15 12:22:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 409 transitions. [2022-04-15 12:22:47,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 409 transitions. [2022-04-15 12:22:48,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:48,138 INFO L225 Difference]: With dead ends: 359 [2022-04-15 12:22:48,138 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 12:22:48,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-15 12:22:48,139 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1028 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:48,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 31 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:22:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 12:22:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 131. [2022-04-15 12:22:48,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:48,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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-15 12:22:48,960 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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-15 12:22:48,960 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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-15 12:22:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:48,964 INFO L93 Difference]: Finished difference Result 345 states and 399 transitions. [2022-04-15 12:22:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 399 transitions. [2022-04-15 12:22:48,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:48,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:48,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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 345 states. [2022-04-15 12:22:48,965 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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 345 states. [2022-04-15 12:22:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:48,969 INFO L93 Difference]: Finished difference Result 345 states and 399 transitions. [2022-04-15 12:22:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 399 transitions. [2022-04-15 12:22:48,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:48,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:48,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:48,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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-15 12:22:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-04-15 12:22:48,971 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2022-04-15 12:22:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:48,971 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-04-15 12:22:48,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 132 transitions. [2022-04-15 12:22:49,253 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-15 12:22:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-15 12:22:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 12:22:49,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:49,254 INFO L499 BasicCegarLoop]: trace histogram [55, 55, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:49,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:49,454 WARN L460 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-15 12:22:49,454 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1869249795, now seen corresponding path program 111 times [2022-04-15 12:22:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:49,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210116602] [2022-04-15 12:22:49,459 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:49,459 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1869249795, now seen corresponding path program 112 times [2022-04-15 12:22:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:49,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431653801] [2022-04-15 12:22:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:50,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:50,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {81361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {81300#true} is VALID [2022-04-15 12:22:50,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 12:22:50,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 12:22:50,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {81300#true} call ULTIMATE.init(); {81361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:50,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {81361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {81300#true} is VALID [2022-04-15 12:22:50,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 12:22:50,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 12:22:50,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {81300#true} call #t~ret5 := main(); {81300#true} is VALID [2022-04-15 12:22:50,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {81300#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81305#(= main_~i~0 0)} is VALID [2022-04-15 12:22:50,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {81305#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81305#(= main_~i~0 0)} is VALID [2022-04-15 12:22:50,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {81305#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:50,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {81306#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:50,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {81306#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:50,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {81307#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 12:22:50,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {81307#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:50,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {81308#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:50,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {81308#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:50,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {81309#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:50,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {81309#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:50,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {81310#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:50,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {81310#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:50,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {81311#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:50,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {81311#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:50,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {81312#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:50,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {81312#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:50,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {81313#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:50,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {81313#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:50,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {81314#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -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 9)} is VALID [2022-04-15 12:22:50,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:50,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {81315#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:50,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:50,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {81316#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:50,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {81316#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:50,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {81317#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:50,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {81317#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:50,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {81318#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:50,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {81318#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:50,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {81319#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:50,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {81319#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:50,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {81320#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:50,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {81320#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:50,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {81321#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -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 16)} is VALID [2022-04-15 12:22:50,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {81321#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:50,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {81322#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:50,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {81322#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:50,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {81323#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:50,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {81323#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:50,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {81324#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:50,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {81324#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:50,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {81325#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:50,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {81325#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:50,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {81326#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:50,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {81326#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:50,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {81327#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:50,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {81327#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:50,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {81328#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -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 23)} is VALID [2022-04-15 12:22:50,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {81328#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:50,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {81329#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:50,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {81329#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:50,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {81330#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:50,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {81330#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:50,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {81331#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:50,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {81331#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:50,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {81332#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:50,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {81332#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:50,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {81333#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:50,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {81333#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:50,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {81334#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:50,645 INFO L290 TraceCheckUtils]: 65: Hoare triple {81334#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:50,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {81335#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -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 30)} is VALID [2022-04-15 12:22:50,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {81335#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:50,645 INFO L290 TraceCheckUtils]: 68: Hoare triple {81336#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:50,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {81336#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:50,646 INFO L290 TraceCheckUtils]: 70: Hoare triple {81337#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:50,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {81337#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:50,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {81338#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:50,647 INFO L290 TraceCheckUtils]: 73: Hoare triple {81338#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:50,647 INFO L290 TraceCheckUtils]: 74: Hoare triple {81339#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:50,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {81339#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:50,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {81340#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:50,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {81340#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:50,649 INFO L290 TraceCheckUtils]: 78: Hoare triple {81341#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:50,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {81341#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:50,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {81342#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -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 37)} is VALID [2022-04-15 12:22:50,650 INFO L290 TraceCheckUtils]: 81: Hoare triple {81342#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:50,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {81343#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:50,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {81343#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:50,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {81344#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:50,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {81344#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:50,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {81345#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:50,652 INFO L290 TraceCheckUtils]: 87: Hoare triple {81345#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:50,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {81346#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:50,652 INFO L290 TraceCheckUtils]: 89: Hoare triple {81346#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:50,652 INFO L290 TraceCheckUtils]: 90: Hoare triple {81347#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:50,653 INFO L290 TraceCheckUtils]: 91: Hoare triple {81347#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:50,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {81348#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:50,653 INFO L290 TraceCheckUtils]: 93: Hoare triple {81348#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:50,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {81349#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -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 44)} is VALID [2022-04-15 12:22:50,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {81349#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:50,654 INFO L290 TraceCheckUtils]: 96: Hoare triple {81350#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:50,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {81350#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:50,655 INFO L290 TraceCheckUtils]: 98: Hoare triple {81351#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:50,655 INFO L290 TraceCheckUtils]: 99: Hoare triple {81351#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:50,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {81352#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:50,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {81352#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:50,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {81353#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:50,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {81353#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:50,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {81354#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:50,657 INFO L290 TraceCheckUtils]: 105: Hoare triple {81354#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:50,658 INFO L290 TraceCheckUtils]: 106: Hoare triple {81355#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:50,658 INFO L290 TraceCheckUtils]: 107: Hoare triple {81355#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:50,658 INFO L290 TraceCheckUtils]: 108: Hoare triple {81356#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -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 51)} is VALID [2022-04-15 12:22:50,659 INFO L290 TraceCheckUtils]: 109: Hoare triple {81356#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:50,659 INFO L290 TraceCheckUtils]: 110: Hoare triple {81357#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:50,659 INFO L290 TraceCheckUtils]: 111: Hoare triple {81357#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:50,659 INFO L290 TraceCheckUtils]: 112: Hoare triple {81358#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:50,660 INFO L290 TraceCheckUtils]: 113: Hoare triple {81358#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:50,660 INFO L290 TraceCheckUtils]: 114: Hoare triple {81359#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:50,660 INFO L290 TraceCheckUtils]: 115: Hoare triple {81359#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81360#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 116: Hoare triple {81360#(<= main_~i~0 55)} assume !(~i~0 < 1023); {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 117: Hoare triple {81301#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 118: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 119: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 120: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 121: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 122: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 123: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 124: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L290 TraceCheckUtils]: 125: Hoare triple {81301#false} assume !(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:50,661 INFO L272 TraceCheckUtils]: 126: Hoare triple {81301#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {81301#false} is VALID [2022-04-15 12:22:50,662 INFO L290 TraceCheckUtils]: 127: Hoare triple {81301#false} ~cond := #in~cond; {81301#false} is VALID [2022-04-15 12:22:50,662 INFO L290 TraceCheckUtils]: 128: Hoare triple {81301#false} assume 0 == ~cond; {81301#false} is VALID [2022-04-15 12:22:50,662 INFO L290 TraceCheckUtils]: 129: Hoare triple {81301#false} assume !false; {81301#false} is VALID [2022-04-15 12:22:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:50,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:50,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431653801] [2022-04-15 12:22:50,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431653801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:50,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509080756] [2022-04-15 12:22:50,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:22:50,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:50,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:50,664 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-15 12:22:50,664 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-15 12:22:51,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:22:51,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:51,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:22:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:51,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:51,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {81300#true} call ULTIMATE.init(); {81300#true} is VALID [2022-04-15 12:22:51,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {81300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {81300#true} is VALID [2022-04-15 12:22:51,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 12:22:51,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 12:22:51,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {81300#true} call #t~ret5 := main(); {81300#true} is VALID [2022-04-15 12:22:51,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {81300#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81380#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:51,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {81380#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81380#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:51,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {81380#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:51,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {81306#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:51,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {81306#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:51,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {81307#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 12:22:51,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {81307#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:51,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {81308#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:51,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {81308#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:51,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {81309#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:51,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {81309#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:51,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {81310#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:51,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {81310#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:51,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {81311#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:51,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {81311#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:51,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {81312#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:51,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {81312#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:51,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {81313#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:51,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {81313#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:51,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {81314#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -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 9)} is VALID [2022-04-15 12:22:51,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:51,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {81315#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:51,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:51,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {81316#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:51,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {81316#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:51,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {81317#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:51,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {81317#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:51,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {81318#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:51,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {81318#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:51,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {81319#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:51,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {81319#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:51,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {81320#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:51,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {81320#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:51,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {81321#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -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 16)} is VALID [2022-04-15 12:22:51,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {81321#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:51,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {81322#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:51,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {81322#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:51,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {81323#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:51,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {81323#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:51,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {81324#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:51,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {81324#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:51,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {81325#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:51,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {81325#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:51,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {81326#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:51,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {81326#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:51,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {81327#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:51,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {81327#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:51,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {81328#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -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 23)} is VALID [2022-04-15 12:22:51,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {81328#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:51,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {81329#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:51,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {81329#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:51,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {81330#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:51,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {81330#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:51,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {81331#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:51,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {81331#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:51,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {81332#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:51,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {81332#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:51,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {81333#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:51,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {81333#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:51,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {81334#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:51,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {81334#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:51,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {81335#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -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 30)} is VALID [2022-04-15 12:22:51,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {81335#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:51,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {81336#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:51,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {81336#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:51,791 INFO L290 TraceCheckUtils]: 70: Hoare triple {81337#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:51,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {81337#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:51,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {81338#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:51,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {81338#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:51,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {81339#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:51,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {81339#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:51,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {81340#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:51,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {81340#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:51,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {81341#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:51,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {81341#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:51,795 INFO L290 TraceCheckUtils]: 80: Hoare triple {81342#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -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 37)} is VALID [2022-04-15 12:22:51,795 INFO L290 TraceCheckUtils]: 81: Hoare triple {81342#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:51,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {81343#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:51,796 INFO L290 TraceCheckUtils]: 83: Hoare triple {81343#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:51,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {81344#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:51,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {81344#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:51,797 INFO L290 TraceCheckUtils]: 86: Hoare triple {81345#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:51,797 INFO L290 TraceCheckUtils]: 87: Hoare triple {81345#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:51,797 INFO L290 TraceCheckUtils]: 88: Hoare triple {81346#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:51,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {81346#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:51,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {81347#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:51,798 INFO L290 TraceCheckUtils]: 91: Hoare triple {81347#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:51,799 INFO L290 TraceCheckUtils]: 92: Hoare triple {81348#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:51,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {81348#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:51,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {81349#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -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 44)} is VALID [2022-04-15 12:22:51,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {81349#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:51,800 INFO L290 TraceCheckUtils]: 96: Hoare triple {81350#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:51,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {81350#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:51,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {81351#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:51,801 INFO L290 TraceCheckUtils]: 99: Hoare triple {81351#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:51,801 INFO L290 TraceCheckUtils]: 100: Hoare triple {81352#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:51,802 INFO L290 TraceCheckUtils]: 101: Hoare triple {81352#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:51,802 INFO L290 TraceCheckUtils]: 102: Hoare triple {81353#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:51,802 INFO L290 TraceCheckUtils]: 103: Hoare triple {81353#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:51,802 INFO L290 TraceCheckUtils]: 104: Hoare triple {81354#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:51,803 INFO L290 TraceCheckUtils]: 105: Hoare triple {81354#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:51,803 INFO L290 TraceCheckUtils]: 106: Hoare triple {81355#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:51,803 INFO L290 TraceCheckUtils]: 107: Hoare triple {81355#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:51,804 INFO L290 TraceCheckUtils]: 108: Hoare triple {81356#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -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 51)} is VALID [2022-04-15 12:22:51,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {81356#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:51,804 INFO L290 TraceCheckUtils]: 110: Hoare triple {81357#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:51,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {81357#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:51,805 INFO L290 TraceCheckUtils]: 112: Hoare triple {81358#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:51,805 INFO L290 TraceCheckUtils]: 113: Hoare triple {81358#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:51,806 INFO L290 TraceCheckUtils]: 114: Hoare triple {81359#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:51,806 INFO L290 TraceCheckUtils]: 115: Hoare triple {81359#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81360#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:51,806 INFO L290 TraceCheckUtils]: 116: Hoare triple {81360#(<= main_~i~0 55)} assume !(~i~0 < 1023); {81301#false} is VALID [2022-04-15 12:22:51,806 INFO L290 TraceCheckUtils]: 117: Hoare triple {81301#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {81301#false} is VALID [2022-04-15 12:22:51,806 INFO L290 TraceCheckUtils]: 118: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 120: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 121: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 122: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 123: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 124: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 125: Hoare triple {81301#false} assume !(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L272 TraceCheckUtils]: 126: Hoare triple {81301#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 127: Hoare triple {81301#false} ~cond := #in~cond; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 128: Hoare triple {81301#false} assume 0 == ~cond; {81301#false} is VALID [2022-04-15 12:22:51,807 INFO L290 TraceCheckUtils]: 129: Hoare triple {81301#false} assume !false; {81301#false} is VALID [2022-04-15 12:22:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:51,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:55,478 INFO L290 TraceCheckUtils]: 129: Hoare triple {81301#false} assume !false; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 128: Hoare triple {81301#false} assume 0 == ~cond; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 127: Hoare triple {81301#false} ~cond := #in~cond; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L272 TraceCheckUtils]: 126: Hoare triple {81301#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 125: Hoare triple {81301#false} assume !(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 124: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 123: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 122: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 121: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 120: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 119: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 118: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 12:22:55,479 INFO L290 TraceCheckUtils]: 117: Hoare triple {81301#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {81301#false} is VALID [2022-04-15 12:22:55,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {81792#(< main_~i~0 1023)} assume !(~i~0 < 1023); {81301#false} is VALID [2022-04-15 12:22:55,480 INFO L290 TraceCheckUtils]: 115: Hoare triple {81796#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81792#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:55,480 INFO L290 TraceCheckUtils]: 114: Hoare triple {81796#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81796#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:55,481 INFO L290 TraceCheckUtils]: 113: Hoare triple {81803#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81796#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:55,481 INFO L290 TraceCheckUtils]: 112: Hoare triple {81803#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81803#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:55,481 INFO L290 TraceCheckUtils]: 111: Hoare triple {81810#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81803#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:55,482 INFO L290 TraceCheckUtils]: 110: Hoare triple {81810#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81810#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:55,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {81817#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81810#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:55,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {81817#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81817#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:55,483 INFO L290 TraceCheckUtils]: 107: Hoare triple {81824#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81817#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:55,483 INFO L290 TraceCheckUtils]: 106: Hoare triple {81824#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81824#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:55,483 INFO L290 TraceCheckUtils]: 105: Hoare triple {81831#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81824#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:55,484 INFO L290 TraceCheckUtils]: 104: Hoare triple {81831#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81831#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:55,484 INFO L290 TraceCheckUtils]: 103: Hoare triple {81838#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81831#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:55,484 INFO L290 TraceCheckUtils]: 102: Hoare triple {81838#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81838#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:55,485 INFO L290 TraceCheckUtils]: 101: Hoare triple {81845#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81838#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:55,485 INFO L290 TraceCheckUtils]: 100: Hoare triple {81845#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81845#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:55,485 INFO L290 TraceCheckUtils]: 99: Hoare triple {81852#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81845#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:55,486 INFO L290 TraceCheckUtils]: 98: Hoare triple {81852#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81852#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:55,486 INFO L290 TraceCheckUtils]: 97: Hoare triple {81859#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81852#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:55,486 INFO L290 TraceCheckUtils]: 96: Hoare triple {81859#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81859#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:55,487 INFO L290 TraceCheckUtils]: 95: Hoare triple {81866#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81859#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:55,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {81866#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81866#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:55,487 INFO L290 TraceCheckUtils]: 93: Hoare triple {81873#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81866#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:55,488 INFO L290 TraceCheckUtils]: 92: Hoare triple {81873#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81873#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:55,488 INFO L290 TraceCheckUtils]: 91: Hoare triple {81880#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81873#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:55,488 INFO L290 TraceCheckUtils]: 90: Hoare triple {81880#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81880#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:55,489 INFO L290 TraceCheckUtils]: 89: Hoare triple {81887#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81880#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:55,489 INFO L290 TraceCheckUtils]: 88: Hoare triple {81887#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81887#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:55,489 INFO L290 TraceCheckUtils]: 87: Hoare triple {81894#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81887#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:55,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {81894#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81894#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:55,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {81901#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81894#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:55,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {81901#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81901#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:55,491 INFO L290 TraceCheckUtils]: 83: Hoare triple {81908#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81901#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:55,491 INFO L290 TraceCheckUtils]: 82: Hoare triple {81908#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81908#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:55,491 INFO L290 TraceCheckUtils]: 81: Hoare triple {81915#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81908#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:55,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {81915#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81915#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:55,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {81922#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81915#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:55,492 INFO L290 TraceCheckUtils]: 78: Hoare triple {81922#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81922#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:55,492 INFO L290 TraceCheckUtils]: 77: Hoare triple {81929#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81922#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:55,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {81929#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81929#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:55,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {81936#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81929#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:55,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {81936#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81936#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:55,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {81943#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81936#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:55,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {81943#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81943#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:55,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {81950#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81943#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:55,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {81950#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81950#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:55,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {81957#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81950#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:55,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {81957#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81957#(< main_~i~0 999)} is VALID [2022-04-15 12:22:55,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {81964#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81957#(< main_~i~0 999)} is VALID [2022-04-15 12:22:55,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {81964#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81964#(< main_~i~0 998)} is VALID [2022-04-15 12:22:55,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {81971#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81964#(< main_~i~0 998)} is VALID [2022-04-15 12:22:55,497 INFO L290 TraceCheckUtils]: 64: Hoare triple {81971#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81971#(< main_~i~0 997)} is VALID [2022-04-15 12:22:55,497 INFO L290 TraceCheckUtils]: 63: Hoare triple {81978#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81971#(< main_~i~0 997)} is VALID [2022-04-15 12:22:55,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {81978#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81978#(< main_~i~0 996)} is VALID [2022-04-15 12:22:55,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {81985#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81978#(< main_~i~0 996)} is VALID [2022-04-15 12:22:55,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {81985#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81985#(< main_~i~0 995)} is VALID [2022-04-15 12:22:55,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {81992#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81985#(< main_~i~0 995)} is VALID [2022-04-15 12:22:55,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {81992#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81992#(< main_~i~0 994)} is VALID [2022-04-15 12:22:55,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {81999#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81992#(< main_~i~0 994)} is VALID [2022-04-15 12:22:55,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {81999#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81999#(< main_~i~0 993)} is VALID [2022-04-15 12:22:55,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {82006#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81999#(< main_~i~0 993)} is VALID [2022-04-15 12:22:55,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {82006#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82006#(< main_~i~0 992)} is VALID [2022-04-15 12:22:55,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {82013#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82006#(< main_~i~0 992)} is VALID [2022-04-15 12:22:55,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {82013#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82013#(< main_~i~0 991)} is VALID [2022-04-15 12:22:55,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {82020#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82013#(< main_~i~0 991)} is VALID [2022-04-15 12:22:55,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {82020#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82020#(< main_~i~0 990)} is VALID [2022-04-15 12:22:55,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {82027#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82020#(< main_~i~0 990)} is VALID [2022-04-15 12:22:55,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {82027#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82027#(< main_~i~0 989)} is VALID [2022-04-15 12:22:55,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {82034#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82027#(< main_~i~0 989)} is VALID [2022-04-15 12:22:55,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {82034#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82034#(< main_~i~0 988)} is VALID [2022-04-15 12:22:55,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {82041#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82034#(< main_~i~0 988)} is VALID [2022-04-15 12:22:55,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {82041#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82041#(< main_~i~0 987)} is VALID [2022-04-15 12:22:55,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {82048#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82041#(< main_~i~0 987)} is VALID [2022-04-15 12:22:55,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {82048#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82048#(< main_~i~0 986)} is VALID [2022-04-15 12:22:55,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {82055#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82048#(< main_~i~0 986)} is VALID [2022-04-15 12:22:55,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {82055#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82055#(< main_~i~0 985)} is VALID [2022-04-15 12:22:55,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {82062#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82055#(< main_~i~0 985)} is VALID [2022-04-15 12:22:55,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {82062#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82062#(< main_~i~0 984)} is VALID [2022-04-15 12:22:55,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {82069#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82062#(< main_~i~0 984)} is VALID [2022-04-15 12:22:55,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {82069#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82069#(< main_~i~0 983)} is VALID [2022-04-15 12:22:55,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {82076#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82069#(< main_~i~0 983)} is VALID [2022-04-15 12:22:55,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {82076#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82076#(< main_~i~0 982)} is VALID [2022-04-15 12:22:55,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {82083#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82076#(< main_~i~0 982)} is VALID [2022-04-15 12:22:55,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {82083#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82083#(< main_~i~0 981)} is VALID [2022-04-15 12:22:55,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {82090#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82083#(< main_~i~0 981)} is VALID [2022-04-15 12:22:55,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {82090#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82090#(< main_~i~0 980)} is VALID [2022-04-15 12:22:55,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {82097#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82090#(< main_~i~0 980)} is VALID [2022-04-15 12:22:55,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {82097#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82097#(< main_~i~0 979)} is VALID [2022-04-15 12:22:55,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {82104#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82097#(< main_~i~0 979)} is VALID [2022-04-15 12:22:55,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {82104#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82104#(< main_~i~0 978)} is VALID [2022-04-15 12:22:55,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {82111#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82104#(< main_~i~0 978)} is VALID [2022-04-15 12:22:55,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {82111#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82111#(< main_~i~0 977)} is VALID [2022-04-15 12:22:55,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {82118#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82111#(< main_~i~0 977)} is VALID [2022-04-15 12:22:55,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {82118#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82118#(< main_~i~0 976)} is VALID [2022-04-15 12:22:55,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {82125#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82118#(< main_~i~0 976)} is VALID [2022-04-15 12:22:55,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {82125#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82125#(< main_~i~0 975)} is VALID [2022-04-15 12:22:55,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {82132#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82125#(< main_~i~0 975)} is VALID [2022-04-15 12:22:55,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {82132#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82132#(< main_~i~0 974)} is VALID [2022-04-15 12:22:55,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {82139#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82132#(< main_~i~0 974)} is VALID [2022-04-15 12:22:55,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {82139#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82139#(< main_~i~0 973)} is VALID [2022-04-15 12:22:55,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {82146#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82139#(< main_~i~0 973)} is VALID [2022-04-15 12:22:55,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {82146#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82146#(< main_~i~0 972)} is VALID [2022-04-15 12:22:55,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {82153#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82146#(< main_~i~0 972)} is VALID [2022-04-15 12:22:55,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {82153#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82153#(< main_~i~0 971)} is VALID [2022-04-15 12:22:55,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {82160#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82153#(< main_~i~0 971)} is VALID [2022-04-15 12:22:55,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {82160#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82160#(< main_~i~0 970)} is VALID [2022-04-15 12:22:55,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {82167#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82160#(< main_~i~0 970)} is VALID [2022-04-15 12:22:55,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {82167#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82167#(< main_~i~0 969)} is VALID [2022-04-15 12:22:55,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {82174#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82167#(< main_~i~0 969)} is VALID [2022-04-15 12:22:55,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {82174#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82174#(< main_~i~0 968)} is VALID [2022-04-15 12:22:55,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {81300#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {82174#(< main_~i~0 968)} is VALID [2022-04-15 12:22:55,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {81300#true} call #t~ret5 := main(); {81300#true} is VALID [2022-04-15 12:22:55,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 12:22:55,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 12:22:55,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {81300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {81300#true} is VALID [2022-04-15 12:22:55,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {81300#true} call ULTIMATE.init(); {81300#true} is VALID [2022-04-15 12:22:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:22:55,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509080756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:55,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:55,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-15 12:22:55,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:55,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210116602] [2022-04-15 12:22:55,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210116602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:55,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:55,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 12:22:55,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812019281] [2022-04-15 12:22:55,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 12:22:55,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:55,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:55,596 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-15 12:22:55,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 12:22:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 12:22:55,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 12:22:55,598 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:06,644 INFO L93 Difference]: Finished difference Result 365 states and 421 transitions. [2022-04-15 12:23:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 12:23:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 12:23:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 416 transitions. [2022-04-15 12:23:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 416 transitions. [2022-04-15 12:23:06,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 416 transitions. [2022-04-15 12:23:06,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:06,949 INFO L225 Difference]: With dead ends: 365 [2022-04-15 12:23:06,949 INFO L226 Difference]: Without dead ends: 351 [2022-04-15 12:23:06,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 12:23:06,951 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 867 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:06,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 46 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:23:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-15 12:23:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 133. [2022-04-15 12:23:07,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:07,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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-15 12:23:07,807 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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-15 12:23:07,807 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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-15 12:23:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:07,818 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2022-04-15 12:23:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2022-04-15 12:23:07,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:07,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:07,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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 351 states. [2022-04-15 12:23:07,818 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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 351 states. [2022-04-15 12:23:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:07,822 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2022-04-15 12:23:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2022-04-15 12:23:07,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:07,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:07,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:07,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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-15 12:23:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2022-04-15 12:23:07,824 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2022-04-15 12:23:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:07,824 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2022-04-15 12:23:07,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:07,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 134 transitions. [2022-04-15 12:23:08,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 12:23:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 12:23:08,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:08,115 INFO L499 BasicCegarLoop]: trace histogram [56, 56, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:08,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-15 12:23:08,327 WARN L460 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-15 12:23:08,327 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1479898783, now seen corresponding path program 113 times [2022-04-15 12:23:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:08,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885742906] [2022-04-15 12:23:08,332 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:23:08,332 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:23:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1479898783, now seen corresponding path program 114 times [2022-04-15 12:23:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:08,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248728176] [2022-04-15 12:23:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:09,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {84070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {84008#true} is VALID [2022-04-15 12:23:09,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 12:23:09,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 12:23:09,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {84008#true} call ULTIMATE.init(); {84070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:09,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {84070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {84008#true} is VALID [2022-04-15 12:23:09,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 12:23:09,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 12:23:09,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {84008#true} call #t~ret5 := main(); {84008#true} is VALID [2022-04-15 12:23:09,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {84008#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {84013#(= main_~i~0 0)} is VALID [2022-04-15 12:23:09,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {84013#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84013#(= main_~i~0 0)} is VALID [2022-04-15 12:23:09,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {84013#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:09,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {84014#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:09,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {84014#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:09,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {84015#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:09,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {84015#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84016#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:09,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {84016#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84016#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:09,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {84016#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84017#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:09,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {84017#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84017#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:09,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {84017#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84018#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:09,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {84018#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84018#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:09,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {84018#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84019#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:09,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {84019#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84019#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:09,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {84019#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84020#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:09,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {84020#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84020#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:09,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {84020#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84021#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:09,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {84021#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84021#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:09,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {84021#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84022#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:09,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {84022#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84022#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:09,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {84022#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84023#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:09,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {84023#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84023#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:09,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {84023#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84024#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:09,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {84024#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84024#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:09,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {84024#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84025#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:09,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {84025#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84025#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:09,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {84025#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84026#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:09,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {84026#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84026#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:09,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {84026#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84027#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:09,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {84027#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84027#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:09,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {84027#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84028#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:09,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {84028#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84028#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:09,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {84028#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84029#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:09,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {84029#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84029#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:09,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {84029#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84030#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:09,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {84030#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84030#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:09,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {84030#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84031#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:09,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {84031#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84031#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:09,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {84031#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84032#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:09,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {84032#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84032#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:09,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {84032#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84033#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:09,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {84033#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84033#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:09,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {84033#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84034#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:09,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {84034#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84034#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:09,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {84034#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84035#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:09,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {84035#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84035#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:09,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {84035#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84036#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:09,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {84036#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84036#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:09,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {84036#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84037#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:09,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {84037#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84037#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:09,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {84037#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84038#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:09,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {84038#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84038#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:09,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {84038#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84039#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:09,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {84039#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84039#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:09,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {84039#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84040#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:09,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {84040#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84040#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:09,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {84040#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84041#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:09,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {84041#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84041#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:09,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {84041#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84042#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:09,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {84042#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84042#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:09,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {84042#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84043#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:09,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {84043#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84043#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:09,560 INFO L290 TraceCheckUtils]: 67: Hoare triple {84043#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84044#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:09,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {84044#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84044#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:09,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {84044#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84045#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:09,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {84045#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84045#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:09,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {84045#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84046#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:09,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {84046#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84046#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:09,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {84046#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84047#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:09,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {84047#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84047#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:09,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {84047#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84048#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:09,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {84048#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84048#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:09,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {84048#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84049#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:09,564 INFO L290 TraceCheckUtils]: 78: Hoare triple {84049#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84049#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:09,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {84049#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84050#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:09,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {84050#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84050#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:09,565 INFO L290 TraceCheckUtils]: 81: Hoare triple {84050#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84051#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:09,565 INFO L290 TraceCheckUtils]: 82: Hoare triple {84051#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84051#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:09,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {84051#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84052#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:09,566 INFO L290 TraceCheckUtils]: 84: Hoare triple {84052#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84052#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:09,566 INFO L290 TraceCheckUtils]: 85: Hoare triple {84052#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84053#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:09,566 INFO L290 TraceCheckUtils]: 86: Hoare triple {84053#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84053#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:09,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {84053#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84054#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:09,567 INFO L290 TraceCheckUtils]: 88: Hoare triple {84054#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84054#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:09,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {84054#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84055#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:09,568 INFO L290 TraceCheckUtils]: 90: Hoare triple {84055#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84055#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:09,568 INFO L290 TraceCheckUtils]: 91: Hoare triple {84055#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84056#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:09,568 INFO L290 TraceCheckUtils]: 92: Hoare triple {84056#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84056#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:09,569 INFO L290 TraceCheckUtils]: 93: Hoare triple {84056#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84057#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:09,569 INFO L290 TraceCheckUtils]: 94: Hoare triple {84057#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84057#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:09,569 INFO L290 TraceCheckUtils]: 95: Hoare triple {84057#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84058#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:09,569 INFO L290 TraceCheckUtils]: 96: Hoare triple {84058#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84058#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:09,570 INFO L290 TraceCheckUtils]: 97: Hoare triple {84058#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84059#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:09,570 INFO L290 TraceCheckUtils]: 98: Hoare triple {84059#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84059#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:09,570 INFO L290 TraceCheckUtils]: 99: Hoare triple {84059#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84060#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:09,571 INFO L290 TraceCheckUtils]: 100: Hoare triple {84060#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84060#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:09,571 INFO L290 TraceCheckUtils]: 101: Hoare triple {84060#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84061#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:09,571 INFO L290 TraceCheckUtils]: 102: Hoare triple {84061#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84061#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:09,572 INFO L290 TraceCheckUtils]: 103: Hoare triple {84061#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84062#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:09,572 INFO L290 TraceCheckUtils]: 104: Hoare triple {84062#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84062#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:09,572 INFO L290 TraceCheckUtils]: 105: Hoare triple {84062#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84063#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:09,573 INFO L290 TraceCheckUtils]: 106: Hoare triple {84063#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84063#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:09,573 INFO L290 TraceCheckUtils]: 107: Hoare triple {84063#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84064#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:09,573 INFO L290 TraceCheckUtils]: 108: Hoare triple {84064#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84064#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:09,574 INFO L290 TraceCheckUtils]: 109: Hoare triple {84064#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84065#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:09,574 INFO L290 TraceCheckUtils]: 110: Hoare triple {84065#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84065#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:09,574 INFO L290 TraceCheckUtils]: 111: Hoare triple {84065#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84066#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:09,575 INFO L290 TraceCheckUtils]: 112: Hoare triple {84066#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84066#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:09,575 INFO L290 TraceCheckUtils]: 113: Hoare triple {84066#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84067#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:09,575 INFO L290 TraceCheckUtils]: 114: Hoare triple {84067#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84067#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:09,576 INFO L290 TraceCheckUtils]: 115: Hoare triple {84067#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84068#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:09,576 INFO L290 TraceCheckUtils]: 116: Hoare triple {84068#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84068#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:09,576 INFO L290 TraceCheckUtils]: 117: Hoare triple {84068#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84069#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 118: Hoare triple {84069#(<= main_~i~0 56)} assume !(~i~0 < 1023); {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 119: Hoare triple {84009#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 120: Hoare triple {84009#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 121: Hoare triple {84009#false} assume !!(0 != #t~mem4);havoc #t~mem4; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 122: Hoare triple {84009#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 123: Hoare triple {84009#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 124: Hoare triple {84009#false} assume !!(0 != #t~mem4);havoc #t~mem4; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 125: Hoare triple {84009#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 126: Hoare triple {84009#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 127: Hoare triple {84009#false} assume !(0 != #t~mem4);havoc #t~mem4; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L272 TraceCheckUtils]: 128: Hoare triple {84009#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 129: Hoare triple {84009#false} ~cond := #in~cond; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 130: Hoare triple {84009#false} assume 0 == ~cond; {84009#false} is VALID [2022-04-15 12:23:09,577 INFO L290 TraceCheckUtils]: 131: Hoare triple {84009#false} assume !false; {84009#false} is VALID [2022-04-15 12:23:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:09,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248728176] [2022-04-15 12:23:09,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248728176] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:09,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833012664] [2022-04-15 12:23:09,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:23:09,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:09,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:09,579 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-15 12:23:09,580 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-15 12:23:09,944 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:23:09,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:09,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:23:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:09,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:10,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {84008#true} call ULTIMATE.init(); {84008#true} is VALID [2022-04-15 12:23:10,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {84008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {84008#true} is VALID [2022-04-15 12:23:10,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {84008#true} call #t~ret5 := main(); {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {84008#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 74: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 79: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 80: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 81: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 82: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 83: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 84: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 89: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 90: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 91: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 92: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 94: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 95: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 97: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 98: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 99: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 100: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 101: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 102: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 103: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 104: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 105: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 106: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 107: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 108: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,317 INFO L290 TraceCheckUtils]: 109: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 110: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 111: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 112: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 113: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 114: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 115: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 116: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 117: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 118: Hoare triple {84008#true} assume !(~i~0 < 1023); {84008#true} is VALID [2022-04-15 12:23:10,318 INFO L290 TraceCheckUtils]: 119: Hoare triple {84008#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {84431#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:10,319 INFO L290 TraceCheckUtils]: 120: Hoare triple {84431#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84431#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:10,319 INFO L290 TraceCheckUtils]: 121: Hoare triple {84431#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {84431#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:10,319 INFO L290 TraceCheckUtils]: 122: Hoare triple {84431#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:10,320 INFO L290 TraceCheckUtils]: 123: Hoare triple {84014#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84014#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:10,320 INFO L290 TraceCheckUtils]: 124: Hoare triple {84014#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:10,320 INFO L290 TraceCheckUtils]: 125: Hoare triple {84014#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:10,321 INFO L290 TraceCheckUtils]: 126: Hoare triple {84015#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84015#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:10,321 INFO L290 TraceCheckUtils]: 127: Hoare triple {84015#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:10,321 INFO L272 TraceCheckUtils]: 128: Hoare triple {84015#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:23:10,322 INFO L290 TraceCheckUtils]: 129: Hoare triple {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:23:10,322 INFO L290 TraceCheckUtils]: 130: Hoare triple {84463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {84009#false} is VALID [2022-04-15 12:23:10,322 INFO L290 TraceCheckUtils]: 131: Hoare triple {84009#false} assume !false; {84009#false} is VALID [2022-04-15 12:23:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 12:23:10,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:10,667 INFO L290 TraceCheckUtils]: 131: Hoare triple {84009#false} assume !false; {84009#false} is VALID [2022-04-15 12:23:10,668 INFO L290 TraceCheckUtils]: 130: Hoare triple {84463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {84009#false} is VALID [2022-04-15 12:23:10,668 INFO L290 TraceCheckUtils]: 129: Hoare triple {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:23:10,669 INFO L272 TraceCheckUtils]: 128: Hoare triple {84479#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:23:10,669 INFO L290 TraceCheckUtils]: 127: Hoare triple {84479#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {84479#(<= main_~i~0 1024)} is VALID [2022-04-15 12:23:10,669 INFO L290 TraceCheckUtils]: 126: Hoare triple {84479#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84479#(<= main_~i~0 1024)} is VALID [2022-04-15 12:23:10,670 INFO L290 TraceCheckUtils]: 125: Hoare triple {84489#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84479#(<= main_~i~0 1024)} is VALID [2022-04-15 12:23:10,670 INFO L290 TraceCheckUtils]: 124: Hoare triple {84489#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {84489#(<= main_~i~0 1023)} is VALID [2022-04-15 12:23:10,670 INFO L290 TraceCheckUtils]: 123: Hoare triple {84489#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84489#(<= main_~i~0 1023)} is VALID [2022-04-15 12:23:10,671 INFO L290 TraceCheckUtils]: 122: Hoare triple {84499#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84489#(<= main_~i~0 1023)} is VALID [2022-04-15 12:23:10,671 INFO L290 TraceCheckUtils]: 121: Hoare triple {84499#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {84499#(<= main_~i~0 1022)} is VALID [2022-04-15 12:23:10,671 INFO L290 TraceCheckUtils]: 120: Hoare triple {84499#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84499#(<= main_~i~0 1022)} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 119: Hoare triple {84008#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {84499#(<= main_~i~0 1022)} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 118: Hoare triple {84008#true} assume !(~i~0 < 1023); {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 117: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 116: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 115: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 114: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 113: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 112: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 111: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 110: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 109: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,672 INFO L290 TraceCheckUtils]: 108: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 107: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 106: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 105: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 104: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 103: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 102: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 101: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 100: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 99: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 98: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 97: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 96: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 95: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 94: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,673 INFO L290 TraceCheckUtils]: 93: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 92: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 91: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 90: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 89: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 88: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 87: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 86: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 85: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 84: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 83: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 82: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 80: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 79: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 77: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 76: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 75: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 74: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 73: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 72: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 71: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 70: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 69: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 47: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {84008#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {84008#true} is VALID [2022-04-15 12:23:10,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {84008#true} call #t~ret5 := main(); {84008#true} is VALID [2022-04-15 12:23:10,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 12:23:10,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 12:23:10,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {84008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {84008#true} is VALID [2022-04-15 12:23:10,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {84008#true} call ULTIMATE.init(); {84008#true} is VALID [2022-04-15 12:23:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 12:23:10,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833012664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:10,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:10,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 7] total 66 [2022-04-15 12:23:10,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:10,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885742906] [2022-04-15 12:23:10,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885742906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:10,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:10,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 12:23:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080651768] [2022-04-15 12:23:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 12:23:10,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:10,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:10,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:10,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 12:23:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 12:23:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:23:10,764 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:22,255 INFO L93 Difference]: Finished difference Result 371 states and 428 transitions. [2022-04-15 12:23:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 12:23:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 12:23:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 423 transitions. [2022-04-15 12:23:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 423 transitions. [2022-04-15 12:23:22,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 423 transitions. [2022-04-15 12:23:22,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:22,558 INFO L225 Difference]: With dead ends: 371 [2022-04-15 12:23:22,558 INFO L226 Difference]: Without dead ends: 357 [2022-04-15 12:23:22,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5551, Invalid=9455, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 12:23:22,559 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 984 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:22,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [984 Valid, 41 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:23:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-15 12:23:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 135. [2022-04-15 12:23:23,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:23,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 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-15 12:23:23,407 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 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-15 12:23:23,407 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 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-15 12:23:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:23,411 INFO L93 Difference]: Finished difference Result 357 states and 413 transitions. [2022-04-15 12:23:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 413 transitions. [2022-04-15 12:23:23,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:23,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:23,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 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 357 states. [2022-04-15 12:23:23,412 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 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 357 states. [2022-04-15 12:23:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:23,416 INFO L93 Difference]: Finished difference Result 357 states and 413 transitions. [2022-04-15 12:23:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 413 transitions. [2022-04-15 12:23:23,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:23,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:23,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:23,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 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-15 12:23:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2022-04-15 12:23:23,417 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2022-04-15 12:23:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:23,417 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2022-04-15 12:23:23,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:23,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 136 transitions. [2022-04-15 12:23:23,720 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-15 12:23:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2022-04-15 12:23:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 12:23:23,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:23,721 INFO L499 BasicCegarLoop]: trace histogram [57, 57, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:23,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-15 12:23:23,922 WARN L460 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-15 12:23:23,922 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1213789759, now seen corresponding path program 115 times [2022-04-15 12:23:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99069862] [2022-04-15 12:23:23,926 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:23:23,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:23:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1213789759, now seen corresponding path program 116 times [2022-04-15 12:23:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:23,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486194181] [2022-04-15 12:23:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:25,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {86771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {86708#true} is VALID [2022-04-15 12:23:25,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 12:23:25,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 12:23:25,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {86708#true} call ULTIMATE.init(); {86771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:25,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {86771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {86708#true} is VALID [2022-04-15 12:23:25,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 12:23:25,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 12:23:25,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {86708#true} call #t~ret5 := main(); {86708#true} is VALID [2022-04-15 12:23:25,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {86708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86713#(= main_~i~0 0)} is VALID [2022-04-15 12:23:25,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {86713#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86713#(= main_~i~0 0)} is VALID [2022-04-15 12:23:25,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {86713#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:25,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {86714#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:25,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {86714#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:25,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {86715#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:25,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {86715#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:25,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {86716#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:25,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {86716#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:25,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {86717#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:25,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {86717#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:25,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {86718#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:25,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {86718#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:25,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {86719#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:25,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {86719#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:25,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {86720#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:25,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {86720#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:25,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {86721#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:25,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {86721#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:25,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {86722#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:25,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {86722#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:25,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {86723#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:25,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {86723#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:25,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {86724#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:25,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {86724#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:25,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {86725#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:25,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {86725#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:25,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {86726#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:25,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {86726#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:25,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {86727#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:25,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {86727#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:25,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {86728#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:25,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {86728#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:25,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {86729#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:25,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {86729#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:25,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {86730#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:25,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {86730#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:25,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {86731#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:25,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {86731#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:25,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {86732#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:25,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {86732#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:25,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {86733#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:25,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {86733#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:25,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {86734#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:25,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {86734#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:25,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {86735#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:25,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {86735#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:25,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {86736#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:25,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {86736#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:25,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {86737#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:25,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {86737#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:25,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {86738#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:25,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {86738#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:25,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {86739#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:25,204 INFO L290 TraceCheckUtils]: 59: Hoare triple {86739#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:25,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {86740#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:25,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {86740#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:25,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {86741#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:25,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {86741#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:25,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {86742#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:25,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {86742#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:25,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {86743#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:25,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {86743#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:25,207 INFO L290 TraceCheckUtils]: 68: Hoare triple {86744#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:25,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {86744#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:25,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {86745#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:25,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {86745#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:25,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {86746#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:25,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {86746#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:25,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {86747#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:25,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {86747#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:25,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {86748#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:25,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {86748#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:25,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {86749#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:25,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {86749#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:25,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {86750#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:25,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {86750#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:25,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {86751#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:25,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {86751#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:25,212 INFO L290 TraceCheckUtils]: 84: Hoare triple {86752#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:25,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {86752#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:25,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {86753#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:25,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {86753#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:25,214 INFO L290 TraceCheckUtils]: 88: Hoare triple {86754#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:25,214 INFO L290 TraceCheckUtils]: 89: Hoare triple {86754#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:25,214 INFO L290 TraceCheckUtils]: 90: Hoare triple {86755#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:25,215 INFO L290 TraceCheckUtils]: 91: Hoare triple {86755#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:25,215 INFO L290 TraceCheckUtils]: 92: Hoare triple {86756#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:25,215 INFO L290 TraceCheckUtils]: 93: Hoare triple {86756#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:25,216 INFO L290 TraceCheckUtils]: 94: Hoare triple {86757#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:25,216 INFO L290 TraceCheckUtils]: 95: Hoare triple {86757#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:25,216 INFO L290 TraceCheckUtils]: 96: Hoare triple {86758#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:25,217 INFO L290 TraceCheckUtils]: 97: Hoare triple {86758#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:25,217 INFO L290 TraceCheckUtils]: 98: Hoare triple {86759#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:25,217 INFO L290 TraceCheckUtils]: 99: Hoare triple {86759#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:25,217 INFO L290 TraceCheckUtils]: 100: Hoare triple {86760#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:25,218 INFO L290 TraceCheckUtils]: 101: Hoare triple {86760#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:25,218 INFO L290 TraceCheckUtils]: 102: Hoare triple {86761#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:25,218 INFO L290 TraceCheckUtils]: 103: Hoare triple {86761#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:25,219 INFO L290 TraceCheckUtils]: 104: Hoare triple {86762#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:25,219 INFO L290 TraceCheckUtils]: 105: Hoare triple {86762#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:25,219 INFO L290 TraceCheckUtils]: 106: Hoare triple {86763#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:25,220 INFO L290 TraceCheckUtils]: 107: Hoare triple {86763#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:25,220 INFO L290 TraceCheckUtils]: 108: Hoare triple {86764#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:25,220 INFO L290 TraceCheckUtils]: 109: Hoare triple {86764#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:25,221 INFO L290 TraceCheckUtils]: 110: Hoare triple {86765#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:25,221 INFO L290 TraceCheckUtils]: 111: Hoare triple {86765#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:25,221 INFO L290 TraceCheckUtils]: 112: Hoare triple {86766#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:25,222 INFO L290 TraceCheckUtils]: 113: Hoare triple {86766#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:25,222 INFO L290 TraceCheckUtils]: 114: Hoare triple {86767#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:25,222 INFO L290 TraceCheckUtils]: 115: Hoare triple {86767#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:25,223 INFO L290 TraceCheckUtils]: 116: Hoare triple {86768#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:25,223 INFO L290 TraceCheckUtils]: 117: Hoare triple {86768#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:25,223 INFO L290 TraceCheckUtils]: 118: Hoare triple {86769#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 119: Hoare triple {86769#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86770#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 120: Hoare triple {86770#(<= main_~i~0 57)} assume !(~i~0 < 1023); {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 121: Hoare triple {86709#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 122: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 123: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 124: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 125: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 126: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 127: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 128: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:25,224 INFO L290 TraceCheckUtils]: 129: Hoare triple {86709#false} assume !(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:25,225 INFO L272 TraceCheckUtils]: 130: Hoare triple {86709#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {86709#false} is VALID [2022-04-15 12:23:25,225 INFO L290 TraceCheckUtils]: 131: Hoare triple {86709#false} ~cond := #in~cond; {86709#false} is VALID [2022-04-15 12:23:25,225 INFO L290 TraceCheckUtils]: 132: Hoare triple {86709#false} assume 0 == ~cond; {86709#false} is VALID [2022-04-15 12:23:25,225 INFO L290 TraceCheckUtils]: 133: Hoare triple {86709#false} assume !false; {86709#false} is VALID [2022-04-15 12:23:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486194181] [2022-04-15 12:23:25,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486194181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801149349] [2022-04-15 12:23:25,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:23:25,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:25,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:25,226 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-15 12:23:25,227 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-15 12:23:25,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:23:25,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:25,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:23:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:25,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:26,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {86708#true} call ULTIMATE.init(); {86708#true} is VALID [2022-04-15 12:23:26,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {86708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {86708#true} is VALID [2022-04-15 12:23:26,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 12:23:26,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 12:23:26,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {86708#true} call #t~ret5 := main(); {86708#true} is VALID [2022-04-15 12:23:26,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {86708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86790#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:26,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {86790#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86790#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:26,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {86790#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:26,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {86714#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:26,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {86714#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:26,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {86715#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:26,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {86715#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:26,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {86716#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:26,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {86716#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:26,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {86717#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:26,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {86717#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:26,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {86718#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:26,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {86718#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:26,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {86719#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:26,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {86719#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:26,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {86720#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:26,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {86720#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:26,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {86721#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:26,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {86721#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:26,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {86722#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:26,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {86722#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:26,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {86723#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:26,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {86723#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:26,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {86724#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:26,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {86724#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:26,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {86725#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:26,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {86725#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:26,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {86726#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:26,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {86726#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:26,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {86727#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:26,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {86727#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:26,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {86728#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:26,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {86728#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:26,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {86729#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:26,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {86729#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:26,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {86730#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:26,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {86730#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:26,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {86731#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:26,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {86731#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:26,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {86732#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:26,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {86732#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:26,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {86733#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:26,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {86733#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:26,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {86734#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:26,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {86734#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:26,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {86735#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:26,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {86735#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:26,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {86736#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:26,387 INFO L290 TraceCheckUtils]: 53: Hoare triple {86736#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:26,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {86737#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:26,387 INFO L290 TraceCheckUtils]: 55: Hoare triple {86737#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:26,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {86738#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:26,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {86738#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:26,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {86739#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:26,388 INFO L290 TraceCheckUtils]: 59: Hoare triple {86739#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:26,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {86740#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:26,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {86740#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:26,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {86741#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:26,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {86741#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:26,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {86742#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:26,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {86742#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:26,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {86743#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:26,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {86743#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:26,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {86744#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:26,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {86744#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:26,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {86745#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:26,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {86745#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:26,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {86746#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:26,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {86746#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:26,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {86747#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:26,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {86747#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:26,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {86748#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:26,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {86748#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:26,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {86749#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:26,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {86749#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:26,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {86750#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:26,396 INFO L290 TraceCheckUtils]: 81: Hoare triple {86750#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:26,396 INFO L290 TraceCheckUtils]: 82: Hoare triple {86751#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:26,396 INFO L290 TraceCheckUtils]: 83: Hoare triple {86751#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:26,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {86752#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:26,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {86752#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:26,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {86753#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:26,398 INFO L290 TraceCheckUtils]: 87: Hoare triple {86753#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:26,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {86754#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:26,398 INFO L290 TraceCheckUtils]: 89: Hoare triple {86754#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:26,399 INFO L290 TraceCheckUtils]: 90: Hoare triple {86755#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:26,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {86755#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:26,399 INFO L290 TraceCheckUtils]: 92: Hoare triple {86756#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:26,400 INFO L290 TraceCheckUtils]: 93: Hoare triple {86756#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:26,400 INFO L290 TraceCheckUtils]: 94: Hoare triple {86757#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:26,400 INFO L290 TraceCheckUtils]: 95: Hoare triple {86757#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:26,400 INFO L290 TraceCheckUtils]: 96: Hoare triple {86758#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:26,401 INFO L290 TraceCheckUtils]: 97: Hoare triple {86758#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:26,401 INFO L290 TraceCheckUtils]: 98: Hoare triple {86759#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:26,401 INFO L290 TraceCheckUtils]: 99: Hoare triple {86759#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:26,402 INFO L290 TraceCheckUtils]: 100: Hoare triple {86760#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:26,402 INFO L290 TraceCheckUtils]: 101: Hoare triple {86760#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:26,402 INFO L290 TraceCheckUtils]: 102: Hoare triple {86761#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:26,403 INFO L290 TraceCheckUtils]: 103: Hoare triple {86761#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:26,403 INFO L290 TraceCheckUtils]: 104: Hoare triple {86762#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:26,403 INFO L290 TraceCheckUtils]: 105: Hoare triple {86762#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:26,404 INFO L290 TraceCheckUtils]: 106: Hoare triple {86763#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:26,404 INFO L290 TraceCheckUtils]: 107: Hoare triple {86763#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:26,404 INFO L290 TraceCheckUtils]: 108: Hoare triple {86764#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:26,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {86764#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:26,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {86765#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:26,405 INFO L290 TraceCheckUtils]: 111: Hoare triple {86765#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:26,406 INFO L290 TraceCheckUtils]: 112: Hoare triple {86766#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:26,406 INFO L290 TraceCheckUtils]: 113: Hoare triple {86766#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:26,406 INFO L290 TraceCheckUtils]: 114: Hoare triple {86767#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:26,407 INFO L290 TraceCheckUtils]: 115: Hoare triple {86767#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:26,407 INFO L290 TraceCheckUtils]: 116: Hoare triple {86768#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:26,407 INFO L290 TraceCheckUtils]: 117: Hoare triple {86768#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:26,408 INFO L290 TraceCheckUtils]: 118: Hoare triple {86769#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:26,408 INFO L290 TraceCheckUtils]: 119: Hoare triple {86769#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86770#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:26,408 INFO L290 TraceCheckUtils]: 120: Hoare triple {86770#(<= main_~i~0 57)} assume !(~i~0 < 1023); {86709#false} is VALID [2022-04-15 12:23:26,408 INFO L290 TraceCheckUtils]: 121: Hoare triple {86709#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {86709#false} is VALID [2022-04-15 12:23:26,408 INFO L290 TraceCheckUtils]: 122: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:26,408 INFO L290 TraceCheckUtils]: 123: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 124: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 127: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 129: Hoare triple {86709#false} assume !(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L272 TraceCheckUtils]: 130: Hoare triple {86709#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 131: Hoare triple {86709#false} ~cond := #in~cond; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 132: Hoare triple {86709#false} assume 0 == ~cond; {86709#false} is VALID [2022-04-15 12:23:26,409 INFO L290 TraceCheckUtils]: 133: Hoare triple {86709#false} assume !false; {86709#false} is VALID [2022-04-15 12:23:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:26,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:30,198 INFO L290 TraceCheckUtils]: 133: Hoare triple {86709#false} assume !false; {86709#false} is VALID [2022-04-15 12:23:30,198 INFO L290 TraceCheckUtils]: 132: Hoare triple {86709#false} assume 0 == ~cond; {86709#false} is VALID [2022-04-15 12:23:30,198 INFO L290 TraceCheckUtils]: 131: Hoare triple {86709#false} ~cond := #in~cond; {86709#false} is VALID [2022-04-15 12:23:30,198 INFO L272 TraceCheckUtils]: 130: Hoare triple {86709#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {86709#false} is VALID [2022-04-15 12:23:30,198 INFO L290 TraceCheckUtils]: 129: Hoare triple {86709#false} assume !(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:30,198 INFO L290 TraceCheckUtils]: 128: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 127: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 126: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 125: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 124: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 123: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 122: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 121: Hoare triple {86709#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {86709#false} is VALID [2022-04-15 12:23:30,199 INFO L290 TraceCheckUtils]: 120: Hoare triple {87214#(< main_~i~0 1023)} assume !(~i~0 < 1023); {86709#false} is VALID [2022-04-15 12:23:30,200 INFO L290 TraceCheckUtils]: 119: Hoare triple {87218#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87214#(< main_~i~0 1023)} is VALID [2022-04-15 12:23:30,200 INFO L290 TraceCheckUtils]: 118: Hoare triple {87218#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87218#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:30,200 INFO L290 TraceCheckUtils]: 117: Hoare triple {87225#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87218#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:30,201 INFO L290 TraceCheckUtils]: 116: Hoare triple {87225#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87225#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:30,201 INFO L290 TraceCheckUtils]: 115: Hoare triple {87232#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87225#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:30,201 INFO L290 TraceCheckUtils]: 114: Hoare triple {87232#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87232#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:30,202 INFO L290 TraceCheckUtils]: 113: Hoare triple {87239#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87232#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:30,202 INFO L290 TraceCheckUtils]: 112: Hoare triple {87239#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87239#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:30,202 INFO L290 TraceCheckUtils]: 111: Hoare triple {87246#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87239#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:30,203 INFO L290 TraceCheckUtils]: 110: Hoare triple {87246#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87246#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:30,203 INFO L290 TraceCheckUtils]: 109: Hoare triple {87253#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87246#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:30,203 INFO L290 TraceCheckUtils]: 108: Hoare triple {87253#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87253#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:30,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {87260#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87253#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:30,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {87260#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87260#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:30,204 INFO L290 TraceCheckUtils]: 105: Hoare triple {87267#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87260#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:30,205 INFO L290 TraceCheckUtils]: 104: Hoare triple {87267#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87267#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:30,205 INFO L290 TraceCheckUtils]: 103: Hoare triple {87274#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87267#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:30,205 INFO L290 TraceCheckUtils]: 102: Hoare triple {87274#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87274#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:30,206 INFO L290 TraceCheckUtils]: 101: Hoare triple {87281#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87274#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:30,206 INFO L290 TraceCheckUtils]: 100: Hoare triple {87281#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87281#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:30,206 INFO L290 TraceCheckUtils]: 99: Hoare triple {87288#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87281#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:30,206 INFO L290 TraceCheckUtils]: 98: Hoare triple {87288#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87288#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:30,207 INFO L290 TraceCheckUtils]: 97: Hoare triple {87295#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87288#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:30,207 INFO L290 TraceCheckUtils]: 96: Hoare triple {87295#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87295#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:30,207 INFO L290 TraceCheckUtils]: 95: Hoare triple {87302#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87295#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:30,208 INFO L290 TraceCheckUtils]: 94: Hoare triple {87302#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87302#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:30,208 INFO L290 TraceCheckUtils]: 93: Hoare triple {87309#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87302#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:30,208 INFO L290 TraceCheckUtils]: 92: Hoare triple {87309#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87309#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:30,209 INFO L290 TraceCheckUtils]: 91: Hoare triple {87316#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87309#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:30,209 INFO L290 TraceCheckUtils]: 90: Hoare triple {87316#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87316#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:30,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {87323#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87316#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:30,210 INFO L290 TraceCheckUtils]: 88: Hoare triple {87323#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87323#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:30,210 INFO L290 TraceCheckUtils]: 87: Hoare triple {87330#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87323#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:30,210 INFO L290 TraceCheckUtils]: 86: Hoare triple {87330#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87330#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:30,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {87337#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87330#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:30,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {87337#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87337#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:30,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {87344#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87337#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:30,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {87344#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87344#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:30,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {87351#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87344#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:30,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {87351#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87351#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:30,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {87358#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87351#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:30,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {87358#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87358#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:30,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {87365#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87358#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:30,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {87365#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87365#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:30,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {87372#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87365#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:30,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {87372#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87372#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:30,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {87379#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87372#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:30,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {87379#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87379#(< main_~i~0 999)} is VALID [2022-04-15 12:23:30,215 INFO L290 TraceCheckUtils]: 71: Hoare triple {87386#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87379#(< main_~i~0 999)} is VALID [2022-04-15 12:23:30,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {87386#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87386#(< main_~i~0 998)} is VALID [2022-04-15 12:23:30,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {87393#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87386#(< main_~i~0 998)} is VALID [2022-04-15 12:23:30,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {87393#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87393#(< main_~i~0 997)} is VALID [2022-04-15 12:23:30,217 INFO L290 TraceCheckUtils]: 67: Hoare triple {87400#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87393#(< main_~i~0 997)} is VALID [2022-04-15 12:23:30,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {87400#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87400#(< main_~i~0 996)} is VALID [2022-04-15 12:23:30,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {87407#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87400#(< main_~i~0 996)} is VALID [2022-04-15 12:23:30,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {87407#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87407#(< main_~i~0 995)} is VALID [2022-04-15 12:23:30,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {87414#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87407#(< main_~i~0 995)} is VALID [2022-04-15 12:23:30,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {87414#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87414#(< main_~i~0 994)} is VALID [2022-04-15 12:23:30,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {87421#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87414#(< main_~i~0 994)} is VALID [2022-04-15 12:23:30,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {87421#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87421#(< main_~i~0 993)} is VALID [2022-04-15 12:23:30,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {87428#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87421#(< main_~i~0 993)} is VALID [2022-04-15 12:23:30,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {87428#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87428#(< main_~i~0 992)} is VALID [2022-04-15 12:23:30,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {87435#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87428#(< main_~i~0 992)} is VALID [2022-04-15 12:23:30,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {87435#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87435#(< main_~i~0 991)} is VALID [2022-04-15 12:23:30,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {87442#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87435#(< main_~i~0 991)} is VALID [2022-04-15 12:23:30,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {87442#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87442#(< main_~i~0 990)} is VALID [2022-04-15 12:23:30,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {87449#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87442#(< main_~i~0 990)} is VALID [2022-04-15 12:23:30,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {87449#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87449#(< main_~i~0 989)} is VALID [2022-04-15 12:23:30,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {87456#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87449#(< main_~i~0 989)} is VALID [2022-04-15 12:23:30,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {87456#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87456#(< main_~i~0 988)} is VALID [2022-04-15 12:23:30,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {87463#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87456#(< main_~i~0 988)} is VALID [2022-04-15 12:23:30,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {87463#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87463#(< main_~i~0 987)} is VALID [2022-04-15 12:23:30,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {87470#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87463#(< main_~i~0 987)} is VALID [2022-04-15 12:23:30,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {87470#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87470#(< main_~i~0 986)} is VALID [2022-04-15 12:23:30,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {87477#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87470#(< main_~i~0 986)} is VALID [2022-04-15 12:23:30,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {87477#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87477#(< main_~i~0 985)} is VALID [2022-04-15 12:23:30,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {87484#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87477#(< main_~i~0 985)} is VALID [2022-04-15 12:23:30,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {87484#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87484#(< main_~i~0 984)} is VALID [2022-04-15 12:23:30,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {87491#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87484#(< main_~i~0 984)} is VALID [2022-04-15 12:23:30,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {87491#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87491#(< main_~i~0 983)} is VALID [2022-04-15 12:23:30,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {87498#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87491#(< main_~i~0 983)} is VALID [2022-04-15 12:23:30,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {87498#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87498#(< main_~i~0 982)} is VALID [2022-04-15 12:23:30,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {87505#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87498#(< main_~i~0 982)} is VALID [2022-04-15 12:23:30,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {87505#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87505#(< main_~i~0 981)} is VALID [2022-04-15 12:23:30,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {87512#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87505#(< main_~i~0 981)} is VALID [2022-04-15 12:23:30,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {87512#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87512#(< main_~i~0 980)} is VALID [2022-04-15 12:23:30,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {87519#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87512#(< main_~i~0 980)} is VALID [2022-04-15 12:23:30,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {87519#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87519#(< main_~i~0 979)} is VALID [2022-04-15 12:23:30,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {87526#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87519#(< main_~i~0 979)} is VALID [2022-04-15 12:23:30,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {87526#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87526#(< main_~i~0 978)} is VALID [2022-04-15 12:23:30,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {87533#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87526#(< main_~i~0 978)} is VALID [2022-04-15 12:23:30,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {87533#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87533#(< main_~i~0 977)} is VALID [2022-04-15 12:23:30,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {87540#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87533#(< main_~i~0 977)} is VALID [2022-04-15 12:23:30,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {87540#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87540#(< main_~i~0 976)} is VALID [2022-04-15 12:23:30,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {87547#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87540#(< main_~i~0 976)} is VALID [2022-04-15 12:23:30,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {87547#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87547#(< main_~i~0 975)} is VALID [2022-04-15 12:23:30,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {87554#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87547#(< main_~i~0 975)} is VALID [2022-04-15 12:23:30,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {87554#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87554#(< main_~i~0 974)} is VALID [2022-04-15 12:23:30,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {87561#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87554#(< main_~i~0 974)} is VALID [2022-04-15 12:23:30,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {87561#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87561#(< main_~i~0 973)} is VALID [2022-04-15 12:23:30,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {87568#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87561#(< main_~i~0 973)} is VALID [2022-04-15 12:23:30,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {87568#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87568#(< main_~i~0 972)} is VALID [2022-04-15 12:23:30,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {87575#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87568#(< main_~i~0 972)} is VALID [2022-04-15 12:23:30,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {87575#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87575#(< main_~i~0 971)} is VALID [2022-04-15 12:23:30,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {87582#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87575#(< main_~i~0 971)} is VALID [2022-04-15 12:23:30,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {87582#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87582#(< main_~i~0 970)} is VALID [2022-04-15 12:23:30,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {87589#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87582#(< main_~i~0 970)} is VALID [2022-04-15 12:23:30,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {87589#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87589#(< main_~i~0 969)} is VALID [2022-04-15 12:23:30,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {87596#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87589#(< main_~i~0 969)} is VALID [2022-04-15 12:23:30,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {87596#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87596#(< main_~i~0 968)} is VALID [2022-04-15 12:23:30,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {87603#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87596#(< main_~i~0 968)} is VALID [2022-04-15 12:23:30,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {87603#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87603#(< main_~i~0 967)} is VALID [2022-04-15 12:23:30,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {87610#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87603#(< main_~i~0 967)} is VALID [2022-04-15 12:23:30,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {87610#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87610#(< main_~i~0 966)} is VALID [2022-04-15 12:23:30,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {86708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {87610#(< main_~i~0 966)} is VALID [2022-04-15 12:23:30,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {86708#true} call #t~ret5 := main(); {86708#true} is VALID [2022-04-15 12:23:30,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 12:23:30,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 12:23:30,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {86708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {86708#true} is VALID [2022-04-15 12:23:30,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {86708#true} call ULTIMATE.init(); {86708#true} is VALID [2022-04-15 12:23:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:30,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801149349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:30,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:30,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-15 12:23:30,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:30,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99069862] [2022-04-15 12:23:30,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99069862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:30,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:30,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 12:23:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769154613] [2022-04-15 12:23:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 12:23:30,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:30,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:30,320 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-15 12:23:30,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 12:23:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 12:23:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 12:23:30,323 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:42,367 INFO L93 Difference]: Finished difference Result 377 states and 435 transitions. [2022-04-15 12:23:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 12:23:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 12:23:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 430 transitions. [2022-04-15 12:23:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 430 transitions. [2022-04-15 12:23:42,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 430 transitions. [2022-04-15 12:23:42,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:42,687 INFO L225 Difference]: With dead ends: 377 [2022-04-15 12:23:42,688 INFO L226 Difference]: Without dead ends: 363 [2022-04-15 12:23:42,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 12:23:42,690 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 870 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:42,691 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [870 Valid, 36 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:23:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-15 12:23:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 137. [2022-04-15 12:23:43,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:43,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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-15 12:23:43,605 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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-15 12:23:43,605 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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-15 12:23:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:43,610 INFO L93 Difference]: Finished difference Result 363 states and 420 transitions. [2022-04-15 12:23:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 420 transitions. [2022-04-15 12:23:43,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:43,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:43,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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 363 states. [2022-04-15 12:23:43,610 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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 363 states. [2022-04-15 12:23:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:43,616 INFO L93 Difference]: Finished difference Result 363 states and 420 transitions. [2022-04-15 12:23:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 420 transitions. [2022-04-15 12:23:43,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:43,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:43,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:43,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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-15 12:23:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-15 12:23:43,619 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2022-04-15 12:23:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:43,619 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-15 12:23:43,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:43,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-15 12:23:43,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 12:23:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 12:23:43,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:43,925 INFO L499 BasicCegarLoop]: trace histogram [58, 58, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:43,942 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-15 12:23:44,125 WARN L460 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-15 12:23:44,125 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 16800867, now seen corresponding path program 117 times [2022-04-15 12:23:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:44,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999257225] [2022-04-15 12:23:44,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:23:44,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:23:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 16800867, now seen corresponding path program 118 times [2022-04-15 12:23:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390805955] [2022-04-15 12:23:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:45,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {89568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {89504#true} is VALID [2022-04-15 12:23:45,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 12:23:45,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 12:23:45,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {89504#true} call ULTIMATE.init(); {89568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:45,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {89568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {89504#true} is VALID [2022-04-15 12:23:45,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 12:23:45,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 12:23:45,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {89504#true} call #t~ret5 := main(); {89504#true} is VALID [2022-04-15 12:23:45,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {89504#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89509#(= main_~i~0 0)} is VALID [2022-04-15 12:23:45,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {89509#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89509#(= main_~i~0 0)} is VALID [2022-04-15 12:23:45,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {89509#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:45,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {89510#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:45,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {89510#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:45,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {89511#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:45,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {89511#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:45,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {89512#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:45,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {89512#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:45,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {89513#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:45,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {89513#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:45,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {89514#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:45,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {89514#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:45,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {89515#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:45,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {89515#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:45,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {89516#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:45,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {89516#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:45,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {89517#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:45,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {89517#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:45,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {89518#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:45,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {89518#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:45,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {89519#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:45,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {89519#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:45,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {89520#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:45,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {89520#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:45,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {89521#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:45,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {89521#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:45,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {89522#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:45,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {89522#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:45,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {89523#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:45,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {89523#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:45,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {89524#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:45,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {89524#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:45,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {89525#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:45,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {89525#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:45,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {89526#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:45,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {89526#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:45,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {89527#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:45,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {89527#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:45,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {89528#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:45,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {89528#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:45,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {89529#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:45,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {89529#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:45,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {89530#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:45,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {89530#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:45,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {89531#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:45,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {89531#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:45,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {89532#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:45,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {89532#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:45,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {89533#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:45,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {89533#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:45,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {89534#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:45,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {89534#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:45,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {89535#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:45,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {89535#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:45,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {89536#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:45,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {89536#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:45,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {89537#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:45,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {89537#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:45,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {89538#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:45,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {89538#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:45,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {89539#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:45,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {89539#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:45,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {89540#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:45,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {89540#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:45,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {89541#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:45,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {89541#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:45,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {89542#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:45,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {89542#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:45,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {89543#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:45,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {89543#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:45,526 INFO L290 TraceCheckUtils]: 76: Hoare triple {89544#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:45,526 INFO L290 TraceCheckUtils]: 77: Hoare triple {89544#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:45,526 INFO L290 TraceCheckUtils]: 78: Hoare triple {89545#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:45,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {89545#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:45,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {89546#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:45,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {89546#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:45,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {89547#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:45,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {89547#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:45,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {89548#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:45,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {89548#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:45,529 INFO L290 TraceCheckUtils]: 86: Hoare triple {89549#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:45,529 INFO L290 TraceCheckUtils]: 87: Hoare triple {89549#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:45,529 INFO L290 TraceCheckUtils]: 88: Hoare triple {89550#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:45,530 INFO L290 TraceCheckUtils]: 89: Hoare triple {89550#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:45,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {89551#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:45,530 INFO L290 TraceCheckUtils]: 91: Hoare triple {89551#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:45,531 INFO L290 TraceCheckUtils]: 92: Hoare triple {89552#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:45,531 INFO L290 TraceCheckUtils]: 93: Hoare triple {89552#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:45,531 INFO L290 TraceCheckUtils]: 94: Hoare triple {89553#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:45,532 INFO L290 TraceCheckUtils]: 95: Hoare triple {89553#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:45,532 INFO L290 TraceCheckUtils]: 96: Hoare triple {89554#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:45,532 INFO L290 TraceCheckUtils]: 97: Hoare triple {89554#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:45,533 INFO L290 TraceCheckUtils]: 98: Hoare triple {89555#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:45,533 INFO L290 TraceCheckUtils]: 99: Hoare triple {89555#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:45,533 INFO L290 TraceCheckUtils]: 100: Hoare triple {89556#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:45,534 INFO L290 TraceCheckUtils]: 101: Hoare triple {89556#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:45,534 INFO L290 TraceCheckUtils]: 102: Hoare triple {89557#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:45,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {89557#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:45,535 INFO L290 TraceCheckUtils]: 104: Hoare triple {89558#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:45,535 INFO L290 TraceCheckUtils]: 105: Hoare triple {89558#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:45,535 INFO L290 TraceCheckUtils]: 106: Hoare triple {89559#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:45,536 INFO L290 TraceCheckUtils]: 107: Hoare triple {89559#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:45,536 INFO L290 TraceCheckUtils]: 108: Hoare triple {89560#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:45,536 INFO L290 TraceCheckUtils]: 109: Hoare triple {89560#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:45,536 INFO L290 TraceCheckUtils]: 110: Hoare triple {89561#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:45,537 INFO L290 TraceCheckUtils]: 111: Hoare triple {89561#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:45,537 INFO L290 TraceCheckUtils]: 112: Hoare triple {89562#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:45,537 INFO L290 TraceCheckUtils]: 113: Hoare triple {89562#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:45,538 INFO L290 TraceCheckUtils]: 114: Hoare triple {89563#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:45,538 INFO L290 TraceCheckUtils]: 115: Hoare triple {89563#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:45,538 INFO L290 TraceCheckUtils]: 116: Hoare triple {89564#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:45,539 INFO L290 TraceCheckUtils]: 117: Hoare triple {89564#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:45,539 INFO L290 TraceCheckUtils]: 118: Hoare triple {89565#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:45,539 INFO L290 TraceCheckUtils]: 119: Hoare triple {89565#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:45,540 INFO L290 TraceCheckUtils]: 120: Hoare triple {89566#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:45,540 INFO L290 TraceCheckUtils]: 121: Hoare triple {89566#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89567#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:45,540 INFO L290 TraceCheckUtils]: 122: Hoare triple {89567#(<= main_~i~0 58)} assume !(~i~0 < 1023); {89505#false} is VALID [2022-04-15 12:23:45,540 INFO L290 TraceCheckUtils]: 123: Hoare triple {89505#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {89505#false} is VALID [2022-04-15 12:23:45,540 INFO L290 TraceCheckUtils]: 124: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 125: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 126: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 127: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 128: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 129: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 130: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 131: Hoare triple {89505#false} assume !(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L272 TraceCheckUtils]: 132: Hoare triple {89505#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 133: Hoare triple {89505#false} ~cond := #in~cond; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 134: Hoare triple {89505#false} assume 0 == ~cond; {89505#false} is VALID [2022-04-15 12:23:45,541 INFO L290 TraceCheckUtils]: 135: Hoare triple {89505#false} assume !false; {89505#false} is VALID [2022-04-15 12:23:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:45,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390805955] [2022-04-15 12:23:45,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390805955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:45,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783797907] [2022-04-15 12:23:45,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:23:45,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:45,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:45,544 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-15 12:23:45,545 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-15 12:23:45,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:23:45,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:45,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 12:23:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:45,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:46,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {89504#true} call ULTIMATE.init(); {89504#true} is VALID [2022-04-15 12:23:46,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {89504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {89504#true} is VALID [2022-04-15 12:23:46,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 12:23:46,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 12:23:46,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {89504#true} call #t~ret5 := main(); {89504#true} is VALID [2022-04-15 12:23:46,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {89504#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89587#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {89587#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89587#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {89587#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {89510#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:46,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {89510#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:46,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {89511#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:46,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {89511#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {89512#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {89512#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {89513#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {89513#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {89514#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {89514#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:46,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {89515#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:46,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {89515#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:46,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {89516#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {89516#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {89517#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {89517#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:46,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {89518#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:46,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {89518#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:46,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {89519#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {89519#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {89520#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {89520#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {89521#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {89521#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {89522#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {89522#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {89523#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {89523#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:46,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {89524#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:46,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {89524#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:46,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {89525#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {89525#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {89526#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {89526#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:46,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {89527#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:46,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {89527#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:46,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {89528#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {89528#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {89529#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {89529#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {89530#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {89530#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {89531#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:46,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {89531#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:46,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {89532#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:46,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {89532#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {89533#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {89533#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {89534#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {89534#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {89535#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {89535#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {89536#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:46,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {89536#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:46,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {89537#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {89537#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 64: Hoare triple {89538#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {89538#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {89539#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {89539#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {89540#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {89540#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:46,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {89541#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:46,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {89541#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:46,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {89542#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {89542#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {89543#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {89543#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {89544#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 77: Hoare triple {89544#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {89545#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:46,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {89545#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:46,737 INFO L290 TraceCheckUtils]: 80: Hoare triple {89546#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:46,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {89546#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {89547#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 83: Hoare triple {89547#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 84: Hoare triple {89548#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {89548#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {89549#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {89549#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:46,740 INFO L290 TraceCheckUtils]: 88: Hoare triple {89550#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:46,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {89550#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:46,740 INFO L290 TraceCheckUtils]: 90: Hoare triple {89551#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 91: Hoare triple {89551#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 92: Hoare triple {89552#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 93: Hoare triple {89552#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 94: Hoare triple {89553#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 95: Hoare triple {89553#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {89554#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:46,743 INFO L290 TraceCheckUtils]: 97: Hoare triple {89554#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:46,743 INFO L290 TraceCheckUtils]: 98: Hoare triple {89555#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:46,743 INFO L290 TraceCheckUtils]: 99: Hoare triple {89555#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:46,744 INFO L290 TraceCheckUtils]: 100: Hoare triple {89556#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:46,744 INFO L290 TraceCheckUtils]: 101: Hoare triple {89556#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:46,744 INFO L290 TraceCheckUtils]: 102: Hoare triple {89557#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:46,745 INFO L290 TraceCheckUtils]: 103: Hoare triple {89557#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:46,745 INFO L290 TraceCheckUtils]: 104: Hoare triple {89558#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:46,745 INFO L290 TraceCheckUtils]: 105: Hoare triple {89558#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:46,746 INFO L290 TraceCheckUtils]: 106: Hoare triple {89559#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:46,746 INFO L290 TraceCheckUtils]: 107: Hoare triple {89559#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:46,746 INFO L290 TraceCheckUtils]: 108: Hoare triple {89560#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:46,747 INFO L290 TraceCheckUtils]: 109: Hoare triple {89560#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:46,747 INFO L290 TraceCheckUtils]: 110: Hoare triple {89561#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:46,747 INFO L290 TraceCheckUtils]: 111: Hoare triple {89561#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:46,747 INFO L290 TraceCheckUtils]: 112: Hoare triple {89562#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:46,748 INFO L290 TraceCheckUtils]: 113: Hoare triple {89562#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:46,748 INFO L290 TraceCheckUtils]: 114: Hoare triple {89563#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:46,748 INFO L290 TraceCheckUtils]: 115: Hoare triple {89563#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:46,749 INFO L290 TraceCheckUtils]: 116: Hoare triple {89564#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:46,749 INFO L290 TraceCheckUtils]: 117: Hoare triple {89564#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:46,749 INFO L290 TraceCheckUtils]: 118: Hoare triple {89565#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:46,750 INFO L290 TraceCheckUtils]: 119: Hoare triple {89565#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:46,750 INFO L290 TraceCheckUtils]: 120: Hoare triple {89566#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:46,750 INFO L290 TraceCheckUtils]: 121: Hoare triple {89566#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89567#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 122: Hoare triple {89567#(<= main_~i~0 58)} assume !(~i~0 < 1023); {89505#false} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 123: Hoare triple {89505#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {89505#false} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 124: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 125: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 126: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 127: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:46,751 INFO L290 TraceCheckUtils]: 128: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L290 TraceCheckUtils]: 129: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L290 TraceCheckUtils]: 130: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L290 TraceCheckUtils]: 131: Hoare triple {89505#false} assume !(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L272 TraceCheckUtils]: 132: Hoare triple {89505#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L290 TraceCheckUtils]: 133: Hoare triple {89505#false} ~cond := #in~cond; {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L290 TraceCheckUtils]: 134: Hoare triple {89505#false} assume 0 == ~cond; {89505#false} is VALID [2022-04-15 12:23:46,752 INFO L290 TraceCheckUtils]: 135: Hoare triple {89505#false} assume !false; {89505#false} is VALID [2022-04-15 12:23:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:46,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:50,698 INFO L290 TraceCheckUtils]: 135: Hoare triple {89505#false} assume !false; {89505#false} is VALID [2022-04-15 12:23:50,698 INFO L290 TraceCheckUtils]: 134: Hoare triple {89505#false} assume 0 == ~cond; {89505#false} is VALID [2022-04-15 12:23:50,698 INFO L290 TraceCheckUtils]: 133: Hoare triple {89505#false} ~cond := #in~cond; {89505#false} is VALID [2022-04-15 12:23:50,698 INFO L272 TraceCheckUtils]: 132: Hoare triple {89505#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {89505#false} is VALID [2022-04-15 12:23:50,698 INFO L290 TraceCheckUtils]: 131: Hoare triple {89505#false} assume !(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:50,698 INFO L290 TraceCheckUtils]: 130: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 129: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 128: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 127: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 126: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 125: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 124: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 123: Hoare triple {89505#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {89505#false} is VALID [2022-04-15 12:23:50,699 INFO L290 TraceCheckUtils]: 122: Hoare triple {90017#(< main_~i~0 1023)} assume !(~i~0 < 1023); {89505#false} is VALID [2022-04-15 12:23:50,700 INFO L290 TraceCheckUtils]: 121: Hoare triple {90021#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90017#(< main_~i~0 1023)} is VALID [2022-04-15 12:23:50,700 INFO L290 TraceCheckUtils]: 120: Hoare triple {90021#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90021#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:50,700 INFO L290 TraceCheckUtils]: 119: Hoare triple {90028#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90021#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:50,701 INFO L290 TraceCheckUtils]: 118: Hoare triple {90028#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90028#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:50,701 INFO L290 TraceCheckUtils]: 117: Hoare triple {90035#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90028#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:50,701 INFO L290 TraceCheckUtils]: 116: Hoare triple {90035#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90035#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:50,702 INFO L290 TraceCheckUtils]: 115: Hoare triple {90042#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90035#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:50,702 INFO L290 TraceCheckUtils]: 114: Hoare triple {90042#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90042#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:50,702 INFO L290 TraceCheckUtils]: 113: Hoare triple {90049#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90042#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:50,703 INFO L290 TraceCheckUtils]: 112: Hoare triple {90049#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90049#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:50,703 INFO L290 TraceCheckUtils]: 111: Hoare triple {90056#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90049#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:50,703 INFO L290 TraceCheckUtils]: 110: Hoare triple {90056#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90056#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:50,704 INFO L290 TraceCheckUtils]: 109: Hoare triple {90063#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90056#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:50,704 INFO L290 TraceCheckUtils]: 108: Hoare triple {90063#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90063#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:50,704 INFO L290 TraceCheckUtils]: 107: Hoare triple {90070#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90063#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:50,705 INFO L290 TraceCheckUtils]: 106: Hoare triple {90070#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90070#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:50,705 INFO L290 TraceCheckUtils]: 105: Hoare triple {90077#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90070#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:50,705 INFO L290 TraceCheckUtils]: 104: Hoare triple {90077#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90077#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:50,706 INFO L290 TraceCheckUtils]: 103: Hoare triple {90084#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90077#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:50,706 INFO L290 TraceCheckUtils]: 102: Hoare triple {90084#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90084#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:50,706 INFO L290 TraceCheckUtils]: 101: Hoare triple {90091#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90084#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:50,706 INFO L290 TraceCheckUtils]: 100: Hoare triple {90091#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90091#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:50,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {90098#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90091#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:50,707 INFO L290 TraceCheckUtils]: 98: Hoare triple {90098#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90098#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:50,708 INFO L290 TraceCheckUtils]: 97: Hoare triple {90105#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90098#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:50,708 INFO L290 TraceCheckUtils]: 96: Hoare triple {90105#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90105#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:50,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {90112#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90105#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:50,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {90112#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90112#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:50,709 INFO L290 TraceCheckUtils]: 93: Hoare triple {90119#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90112#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:50,709 INFO L290 TraceCheckUtils]: 92: Hoare triple {90119#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90119#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:50,710 INFO L290 TraceCheckUtils]: 91: Hoare triple {90126#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90119#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:50,710 INFO L290 TraceCheckUtils]: 90: Hoare triple {90126#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90126#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:50,710 INFO L290 TraceCheckUtils]: 89: Hoare triple {90133#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90126#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:50,710 INFO L290 TraceCheckUtils]: 88: Hoare triple {90133#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90133#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:50,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {90140#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90133#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:50,711 INFO L290 TraceCheckUtils]: 86: Hoare triple {90140#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90140#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:50,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {90147#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90140#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:50,712 INFO L290 TraceCheckUtils]: 84: Hoare triple {90147#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90147#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:50,712 INFO L290 TraceCheckUtils]: 83: Hoare triple {90154#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90147#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:50,712 INFO L290 TraceCheckUtils]: 82: Hoare triple {90154#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90154#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:50,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {90161#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90154#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:50,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {90161#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90161#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:50,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {90168#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90161#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:50,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {90168#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90168#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:50,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {90175#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90168#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:50,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {90175#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90175#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:50,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {90182#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90175#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:50,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {90182#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90182#(< main_~i~0 999)} is VALID [2022-04-15 12:23:50,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {90189#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90182#(< main_~i~0 999)} is VALID [2022-04-15 12:23:50,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {90189#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90189#(< main_~i~0 998)} is VALID [2022-04-15 12:23:50,716 INFO L290 TraceCheckUtils]: 71: Hoare triple {90196#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90189#(< main_~i~0 998)} is VALID [2022-04-15 12:23:50,716 INFO L290 TraceCheckUtils]: 70: Hoare triple {90196#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90196#(< main_~i~0 997)} is VALID [2022-04-15 12:23:50,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {90203#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90196#(< main_~i~0 997)} is VALID [2022-04-15 12:23:50,717 INFO L290 TraceCheckUtils]: 68: Hoare triple {90203#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90203#(< main_~i~0 996)} is VALID [2022-04-15 12:23:50,717 INFO L290 TraceCheckUtils]: 67: Hoare triple {90210#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90203#(< main_~i~0 996)} is VALID [2022-04-15 12:23:50,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {90210#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90210#(< main_~i~0 995)} is VALID [2022-04-15 12:23:50,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {90217#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90210#(< main_~i~0 995)} is VALID [2022-04-15 12:23:50,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {90217#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90217#(< main_~i~0 994)} is VALID [2022-04-15 12:23:50,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {90224#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90217#(< main_~i~0 994)} is VALID [2022-04-15 12:23:50,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {90224#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90224#(< main_~i~0 993)} is VALID [2022-04-15 12:23:50,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {90231#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90224#(< main_~i~0 993)} is VALID [2022-04-15 12:23:50,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {90231#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90231#(< main_~i~0 992)} is VALID [2022-04-15 12:23:50,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {90238#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90231#(< main_~i~0 992)} is VALID [2022-04-15 12:23:50,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {90238#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90238#(< main_~i~0 991)} is VALID [2022-04-15 12:23:50,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {90245#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90238#(< main_~i~0 991)} is VALID [2022-04-15 12:23:50,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {90245#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90245#(< main_~i~0 990)} is VALID [2022-04-15 12:23:50,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {90252#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90245#(< main_~i~0 990)} is VALID [2022-04-15 12:23:50,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {90252#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90252#(< main_~i~0 989)} is VALID [2022-04-15 12:23:50,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {90259#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90252#(< main_~i~0 989)} is VALID [2022-04-15 12:23:50,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {90259#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90259#(< main_~i~0 988)} is VALID [2022-04-15 12:23:50,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {90266#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90259#(< main_~i~0 988)} is VALID [2022-04-15 12:23:50,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {90266#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90266#(< main_~i~0 987)} is VALID [2022-04-15 12:23:50,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {90273#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90266#(< main_~i~0 987)} is VALID [2022-04-15 12:23:50,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {90273#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90273#(< main_~i~0 986)} is VALID [2022-04-15 12:23:50,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {90280#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90273#(< main_~i~0 986)} is VALID [2022-04-15 12:23:50,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {90280#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90280#(< main_~i~0 985)} is VALID [2022-04-15 12:23:50,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {90287#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90280#(< main_~i~0 985)} is VALID [2022-04-15 12:23:50,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {90287#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90287#(< main_~i~0 984)} is VALID [2022-04-15 12:23:50,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {90294#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90287#(< main_~i~0 984)} is VALID [2022-04-15 12:23:50,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {90294#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90294#(< main_~i~0 983)} is VALID [2022-04-15 12:23:50,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {90301#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90294#(< main_~i~0 983)} is VALID [2022-04-15 12:23:50,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {90301#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90301#(< main_~i~0 982)} is VALID [2022-04-15 12:23:50,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {90308#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90301#(< main_~i~0 982)} is VALID [2022-04-15 12:23:50,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {90308#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90308#(< main_~i~0 981)} is VALID [2022-04-15 12:23:50,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {90315#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90308#(< main_~i~0 981)} is VALID [2022-04-15 12:23:50,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {90315#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90315#(< main_~i~0 980)} is VALID [2022-04-15 12:23:50,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {90322#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90315#(< main_~i~0 980)} is VALID [2022-04-15 12:23:50,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {90322#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90322#(< main_~i~0 979)} is VALID [2022-04-15 12:23:50,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {90329#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90322#(< main_~i~0 979)} is VALID [2022-04-15 12:23:50,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {90329#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90329#(< main_~i~0 978)} is VALID [2022-04-15 12:23:50,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {90336#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90329#(< main_~i~0 978)} is VALID [2022-04-15 12:23:50,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {90336#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90336#(< main_~i~0 977)} is VALID [2022-04-15 12:23:50,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {90343#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90336#(< main_~i~0 977)} is VALID [2022-04-15 12:23:50,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {90343#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90343#(< main_~i~0 976)} is VALID [2022-04-15 12:23:50,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {90350#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90343#(< main_~i~0 976)} is VALID [2022-04-15 12:23:50,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {90350#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90350#(< main_~i~0 975)} is VALID [2022-04-15 12:23:50,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {90357#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90350#(< main_~i~0 975)} is VALID [2022-04-15 12:23:50,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {90357#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90357#(< main_~i~0 974)} is VALID [2022-04-15 12:23:50,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {90364#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90357#(< main_~i~0 974)} is VALID [2022-04-15 12:23:50,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {90364#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90364#(< main_~i~0 973)} is VALID [2022-04-15 12:23:50,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {90371#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90364#(< main_~i~0 973)} is VALID [2022-04-15 12:23:50,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {90371#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90371#(< main_~i~0 972)} is VALID [2022-04-15 12:23:50,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {90378#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90371#(< main_~i~0 972)} is VALID [2022-04-15 12:23:50,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {90378#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90378#(< main_~i~0 971)} is VALID [2022-04-15 12:23:50,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {90385#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90378#(< main_~i~0 971)} is VALID [2022-04-15 12:23:50,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {90385#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90385#(< main_~i~0 970)} is VALID [2022-04-15 12:23:50,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {90392#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90385#(< main_~i~0 970)} is VALID [2022-04-15 12:23:50,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {90392#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90392#(< main_~i~0 969)} is VALID [2022-04-15 12:23:50,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {90399#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90392#(< main_~i~0 969)} is VALID [2022-04-15 12:23:50,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {90399#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90399#(< main_~i~0 968)} is VALID [2022-04-15 12:23:50,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {90406#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90399#(< main_~i~0 968)} is VALID [2022-04-15 12:23:50,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {90406#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90406#(< main_~i~0 967)} is VALID [2022-04-15 12:23:50,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {90413#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90406#(< main_~i~0 967)} is VALID [2022-04-15 12:23:50,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {90413#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90413#(< main_~i~0 966)} is VALID [2022-04-15 12:23:50,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {90420#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90413#(< main_~i~0 966)} is VALID [2022-04-15 12:23:50,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {90420#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90420#(< main_~i~0 965)} is VALID [2022-04-15 12:23:50,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {89504#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {90420#(< main_~i~0 965)} is VALID [2022-04-15 12:23:50,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {89504#true} call #t~ret5 := main(); {89504#true} is VALID [2022-04-15 12:23:50,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 12:23:50,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 12:23:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {89504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {89504#true} is VALID [2022-04-15 12:23:50,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {89504#true} call ULTIMATE.init(); {89504#true} is VALID [2022-04-15 12:23:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:23:50,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783797907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:50,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:50,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-15 12:23:50,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:50,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999257225] [2022-04-15 12:23:50,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999257225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:50,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:50,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 12:23:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947619123] [2022-04-15 12:23:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-04-15 12:23:50,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:50,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:50,825 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-15 12:23:50,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 12:23:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 12:23:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 12:23:50,827 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:03,285 INFO L93 Difference]: Finished difference Result 383 states and 442 transitions. [2022-04-15 12:24:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 12:24:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-04-15 12:24:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 437 transitions. [2022-04-15 12:24:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 437 transitions. [2022-04-15 12:24:03,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 437 transitions. [2022-04-15 12:24:03,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:03,602 INFO L225 Difference]: With dead ends: 383 [2022-04-15 12:24:03,602 INFO L226 Difference]: Without dead ends: 369 [2022-04-15 12:24:03,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 12:24:03,604 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 903 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:03,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 51 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:24:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-15 12:24:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 139. [2022-04-15 12:24:04,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:04,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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-15 12:24:04,532 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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-15 12:24:04,532 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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-15 12:24:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:04,536 INFO L93 Difference]: Finished difference Result 369 states and 427 transitions. [2022-04-15 12:24:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 427 transitions. [2022-04-15 12:24:04,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:04,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:04,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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 369 states. [2022-04-15 12:24:04,537 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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 369 states. [2022-04-15 12:24:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:04,541 INFO L93 Difference]: Finished difference Result 369 states and 427 transitions. [2022-04-15 12:24:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 427 transitions. [2022-04-15 12:24:04,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:04,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:04,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:04,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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-15 12:24:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-15 12:24:04,543 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2022-04-15 12:24:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:04,543 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-15 12:24:04,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:04,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-15 12:24:04,845 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-15 12:24:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-15 12:24:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 12:24:04,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:04,845 INFO L499 BasicCegarLoop]: trace histogram [59, 59, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:04,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-15 12:24:05,047 WARN L460 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-15 12:24:05,047 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1498386053, now seen corresponding path program 119 times [2022-04-15 12:24:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:05,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52967417] [2022-04-15 12:24:05,052 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:24:05,052 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:24:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1498386053, now seen corresponding path program 120 times [2022-04-15 12:24:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:05,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453263268] [2022-04-15 12:24:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:06,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {92409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {92344#true} is VALID [2022-04-15 12:24:06,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 12:24:06,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 12:24:06,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {92344#true} call ULTIMATE.init(); {92409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:06,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {92409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {92344#true} is VALID [2022-04-15 12:24:06,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 12:24:06,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 12:24:06,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {92344#true} call #t~ret5 := main(); {92344#true} is VALID [2022-04-15 12:24:06,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {92344#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92349#(= main_~i~0 0)} is VALID [2022-04-15 12:24:06,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {92349#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -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 0)} is VALID [2022-04-15 12:24:06,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {92349#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92350#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:06,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {92350#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 12:24:06,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {92350#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92351#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:06,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {92351#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 12:24:06,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {92351#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92352#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:06,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {92352#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -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 3)} is VALID [2022-04-15 12:24:06,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {92352#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92353#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:06,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {92353#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 12:24:06,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {92353#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92354#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:06,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {92354#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -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 5)} is VALID [2022-04-15 12:24:06,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {92354#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92355#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:06,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {92355#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 12:24:06,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {92355#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92356#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:06,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {92356#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -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 7)} is VALID [2022-04-15 12:24:06,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {92356#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92357#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:06,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {92357#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -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 8)} is VALID [2022-04-15 12:24:06,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {92357#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92358#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:06,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {92358#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -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 9)} is VALID [2022-04-15 12:24:06,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {92358#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92359#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:06,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {92359#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -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 10)} is VALID [2022-04-15 12:24:06,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {92359#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92360#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:06,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {92360#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -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 11)} is VALID [2022-04-15 12:24:06,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {92360#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92361#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:06,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {92361#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -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 12)} is VALID [2022-04-15 12:24:06,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {92361#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92362#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:06,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {92362#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -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 13)} is VALID [2022-04-15 12:24:06,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {92362#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92363#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:06,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {92363#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -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 14)} is VALID [2022-04-15 12:24:06,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {92363#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92364#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:06,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {92364#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -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 15)} is VALID [2022-04-15 12:24:06,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {92364#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92365#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:06,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {92365#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -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 16)} is VALID [2022-04-15 12:24:06,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {92365#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92366#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:06,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {92366#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -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 17)} is VALID [2022-04-15 12:24:06,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {92366#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92367#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:06,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {92367#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -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 18)} is VALID [2022-04-15 12:24:06,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {92367#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92368#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:06,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {92368#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -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 19)} is VALID [2022-04-15 12:24:06,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {92368#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92369#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:06,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {92369#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -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 20)} is VALID [2022-04-15 12:24:06,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {92369#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92370#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:06,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {92370#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -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 21)} is VALID [2022-04-15 12:24:06,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {92370#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92371#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:06,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {92371#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -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 22)} is VALID [2022-04-15 12:24:06,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {92371#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92372#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:06,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {92372#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -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 23)} is VALID [2022-04-15 12:24:06,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {92372#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92373#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:06,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {92373#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -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 24)} is VALID [2022-04-15 12:24:06,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {92373#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92374#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:06,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {92374#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92374#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:06,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {92374#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92375#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:06,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {92375#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92375#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:06,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {92375#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92376#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:06,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {92376#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92376#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:06,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {92376#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92377#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:06,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {92377#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92377#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:06,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {92377#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92378#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:06,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {92378#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92378#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:06,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {92378#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92379#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:06,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {92379#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92379#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:06,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {92379#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92380#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:06,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {92380#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92380#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:06,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {92380#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92381#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:06,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {92381#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92381#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:06,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {92381#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92382#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:06,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {92382#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92382#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:06,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {92382#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92383#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:06,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {92383#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92383#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:06,429 INFO L290 TraceCheckUtils]: 75: Hoare triple {92383#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92384#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:06,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {92384#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92384#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:06,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {92384#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92385#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:06,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {92385#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92385#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:06,430 INFO L290 TraceCheckUtils]: 79: Hoare triple {92385#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92386#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:06,430 INFO L290 TraceCheckUtils]: 80: Hoare triple {92386#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92386#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:06,431 INFO L290 TraceCheckUtils]: 81: Hoare triple {92386#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92387#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:06,431 INFO L290 TraceCheckUtils]: 82: Hoare triple {92387#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92387#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:06,431 INFO L290 TraceCheckUtils]: 83: Hoare triple {92387#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92388#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:06,432 INFO L290 TraceCheckUtils]: 84: Hoare triple {92388#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92388#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:06,432 INFO L290 TraceCheckUtils]: 85: Hoare triple {92388#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92389#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:06,432 INFO L290 TraceCheckUtils]: 86: Hoare triple {92389#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92389#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:06,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {92389#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92390#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:06,433 INFO L290 TraceCheckUtils]: 88: Hoare triple {92390#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92390#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:06,433 INFO L290 TraceCheckUtils]: 89: Hoare triple {92390#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92391#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:06,433 INFO L290 TraceCheckUtils]: 90: Hoare triple {92391#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92391#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:06,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {92391#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92392#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:06,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {92392#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92392#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:06,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {92392#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92393#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:06,435 INFO L290 TraceCheckUtils]: 94: Hoare triple {92393#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92393#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:06,435 INFO L290 TraceCheckUtils]: 95: Hoare triple {92393#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92394#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:06,435 INFO L290 TraceCheckUtils]: 96: Hoare triple {92394#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92394#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:06,436 INFO L290 TraceCheckUtils]: 97: Hoare triple {92394#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92395#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:06,436 INFO L290 TraceCheckUtils]: 98: Hoare triple {92395#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92395#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:06,436 INFO L290 TraceCheckUtils]: 99: Hoare triple {92395#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92396#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:06,437 INFO L290 TraceCheckUtils]: 100: Hoare triple {92396#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92396#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:06,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {92396#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92397#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:06,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {92397#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92397#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:06,438 INFO L290 TraceCheckUtils]: 103: Hoare triple {92397#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92398#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:06,438 INFO L290 TraceCheckUtils]: 104: Hoare triple {92398#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92398#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:06,438 INFO L290 TraceCheckUtils]: 105: Hoare triple {92398#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92399#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:06,439 INFO L290 TraceCheckUtils]: 106: Hoare triple {92399#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92399#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:06,439 INFO L290 TraceCheckUtils]: 107: Hoare triple {92399#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92400#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:06,439 INFO L290 TraceCheckUtils]: 108: Hoare triple {92400#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92400#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:06,440 INFO L290 TraceCheckUtils]: 109: Hoare triple {92400#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92401#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:06,440 INFO L290 TraceCheckUtils]: 110: Hoare triple {92401#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92401#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:06,440 INFO L290 TraceCheckUtils]: 111: Hoare triple {92401#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92402#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:06,440 INFO L290 TraceCheckUtils]: 112: Hoare triple {92402#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92402#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:06,441 INFO L290 TraceCheckUtils]: 113: Hoare triple {92402#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92403#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:06,441 INFO L290 TraceCheckUtils]: 114: Hoare triple {92403#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92403#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:06,441 INFO L290 TraceCheckUtils]: 115: Hoare triple {92403#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92404#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:06,442 INFO L290 TraceCheckUtils]: 116: Hoare triple {92404#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92404#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:06,442 INFO L290 TraceCheckUtils]: 117: Hoare triple {92404#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92405#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:06,442 INFO L290 TraceCheckUtils]: 118: Hoare triple {92405#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92405#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:06,443 INFO L290 TraceCheckUtils]: 119: Hoare triple {92405#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92406#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:06,443 INFO L290 TraceCheckUtils]: 120: Hoare triple {92406#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92406#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:06,443 INFO L290 TraceCheckUtils]: 121: Hoare triple {92406#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92407#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:06,444 INFO L290 TraceCheckUtils]: 122: Hoare triple {92407#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92407#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:06,444 INFO L290 TraceCheckUtils]: 123: Hoare triple {92407#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92408#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:06,444 INFO L290 TraceCheckUtils]: 124: Hoare triple {92408#(<= main_~i~0 59)} assume !(~i~0 < 1023); {92345#false} is VALID [2022-04-15 12:24:06,444 INFO L290 TraceCheckUtils]: 125: Hoare triple {92345#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 126: Hoare triple {92345#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 127: Hoare triple {92345#false} assume !!(0 != #t~mem4);havoc #t~mem4; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 128: Hoare triple {92345#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 129: Hoare triple {92345#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 130: Hoare triple {92345#false} assume !!(0 != #t~mem4);havoc #t~mem4; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 131: Hoare triple {92345#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 132: Hoare triple {92345#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 133: Hoare triple {92345#false} assume !(0 != #t~mem4);havoc #t~mem4; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L272 TraceCheckUtils]: 134: Hoare triple {92345#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 135: Hoare triple {92345#false} ~cond := #in~cond; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 136: Hoare triple {92345#false} assume 0 == ~cond; {92345#false} is VALID [2022-04-15 12:24:06,445 INFO L290 TraceCheckUtils]: 137: Hoare triple {92345#false} assume !false; {92345#false} is VALID [2022-04-15 12:24:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453263268] [2022-04-15 12:24:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453263268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117482735] [2022-04-15 12:24:06,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:24:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:06,447 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-15 12:24:06,447 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-15 12:24:06,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:24:06,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:06,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:24:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:06,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:07,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {92344#true} call ULTIMATE.init(); {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {92344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {92344#true} call #t~ret5 := main(); {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {92344#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 68: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 71: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 72: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 73: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 74: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 75: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 76: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 78: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 79: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 80: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 81: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 86: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 87: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 88: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 89: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 90: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 91: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 92: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 93: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 94: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 95: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 97: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 98: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 99: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,170 INFO L290 TraceCheckUtils]: 100: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 101: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 103: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 104: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 107: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 108: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 109: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 110: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 111: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 112: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 113: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 114: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,171 INFO L290 TraceCheckUtils]: 115: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 116: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 117: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 118: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 119: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 120: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 121: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 122: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 123: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 124: Hoare triple {92344#true} assume !(~i~0 < 1023); {92344#true} is VALID [2022-04-15 12:24:07,172 INFO L290 TraceCheckUtils]: 125: Hoare triple {92344#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {92788#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:07,173 INFO L290 TraceCheckUtils]: 126: Hoare triple {92788#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92788#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:07,173 INFO L290 TraceCheckUtils]: 127: Hoare triple {92788#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {92788#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:07,173 INFO L290 TraceCheckUtils]: 128: Hoare triple {92788#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92350#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:07,174 INFO L290 TraceCheckUtils]: 129: Hoare triple {92350#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92350#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:07,174 INFO L290 TraceCheckUtils]: 130: Hoare triple {92350#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {92350#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:07,174 INFO L290 TraceCheckUtils]: 131: Hoare triple {92350#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92351#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:07,175 INFO L290 TraceCheckUtils]: 132: Hoare triple {92351#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92351#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:07,175 INFO L290 TraceCheckUtils]: 133: Hoare triple {92351#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {92351#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:07,175 INFO L272 TraceCheckUtils]: 134: Hoare triple {92351#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:24:07,176 INFO L290 TraceCheckUtils]: 135: Hoare triple {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:24:07,176 INFO L290 TraceCheckUtils]: 136: Hoare triple {92820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92345#false} is VALID [2022-04-15 12:24:07,176 INFO L290 TraceCheckUtils]: 137: Hoare triple {92345#false} assume !false; {92345#false} is VALID [2022-04-15 12:24:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 12:24:07,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:07,529 INFO L290 TraceCheckUtils]: 137: Hoare triple {92345#false} assume !false; {92345#false} is VALID [2022-04-15 12:24:07,529 INFO L290 TraceCheckUtils]: 136: Hoare triple {92820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92345#false} is VALID [2022-04-15 12:24:07,530 INFO L290 TraceCheckUtils]: 135: Hoare triple {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:24:07,530 INFO L272 TraceCheckUtils]: 134: Hoare triple {92836#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:24:07,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {92836#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {92836#(<= main_~i~0 1024)} is VALID [2022-04-15 12:24:07,531 INFO L290 TraceCheckUtils]: 132: Hoare triple {92836#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92836#(<= main_~i~0 1024)} is VALID [2022-04-15 12:24:07,531 INFO L290 TraceCheckUtils]: 131: Hoare triple {92846#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92836#(<= main_~i~0 1024)} is VALID [2022-04-15 12:24:07,531 INFO L290 TraceCheckUtils]: 130: Hoare triple {92846#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {92846#(<= main_~i~0 1023)} is VALID [2022-04-15 12:24:07,532 INFO L290 TraceCheckUtils]: 129: Hoare triple {92846#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92846#(<= main_~i~0 1023)} is VALID [2022-04-15 12:24:07,532 INFO L290 TraceCheckUtils]: 128: Hoare triple {92856#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92846#(<= main_~i~0 1023)} is VALID [2022-04-15 12:24:07,532 INFO L290 TraceCheckUtils]: 127: Hoare triple {92856#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {92856#(<= main_~i~0 1022)} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 126: Hoare triple {92856#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92856#(<= main_~i~0 1022)} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 125: Hoare triple {92344#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {92856#(<= main_~i~0 1022)} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 124: Hoare triple {92344#true} assume !(~i~0 < 1023); {92344#true} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 123: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 122: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 121: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 120: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 119: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,533 INFO L290 TraceCheckUtils]: 118: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 117: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 116: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 115: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 114: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 113: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 112: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 111: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 110: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 109: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 107: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 106: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 102: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 101: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 100: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 99: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 98: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 97: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 96: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 95: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 94: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 93: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 87: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 84: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 83: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 82: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 81: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 80: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 78: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 76: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 65: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 64: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 63: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {92344#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {92344#true} call #t~ret5 := main(); {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {92344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {92344#true} is VALID [2022-04-15 12:24:07,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {92344#true} call ULTIMATE.init(); {92344#true} is VALID [2022-04-15 12:24:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 12:24:07,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117482735] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:07,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:07,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 7, 7] total 69 [2022-04-15 12:24:07,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:07,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52967417] [2022-04-15 12:24:07,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52967417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:07,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:07,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 12:24:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972003059] [2022-04-15 12:24:07,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:07,543 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-15 12:24:07,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:07,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:07,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:07,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 12:24:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:07,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 12:24:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2151, Invalid=2541, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:24:07,628 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:20,219 INFO L93 Difference]: Finished difference Result 389 states and 449 transitions. [2022-04-15 12:24:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 12:24:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-15 12:24:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 444 transitions. [2022-04-15 12:24:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 444 transitions. [2022-04-15 12:24:20,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 444 transitions. [2022-04-15 12:24:20,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:20,536 INFO L225 Difference]: With dead ends: 389 [2022-04-15 12:24:20,536 INFO L226 Difference]: Without dead ends: 375 [2022-04-15 12:24:20,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6112, Invalid=10400, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 12:24:20,537 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 950 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:20,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 51 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:24:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-15 12:24:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 141. [2022-04-15 12:24:21,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:21,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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-15 12:24:21,500 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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-15 12:24:21,500 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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-15 12:24:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:21,504 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2022-04-15 12:24:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 434 transitions. [2022-04-15 12:24:21,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:21,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:21,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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 375 states. [2022-04-15 12:24:21,505 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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 375 states. [2022-04-15 12:24:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:21,510 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2022-04-15 12:24:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 434 transitions. [2022-04-15 12:24:21,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:21,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:21,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:21,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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-15 12:24:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2022-04-15 12:24:21,511 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2022-04-15 12:24:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:21,511 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2022-04-15 12:24:21,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:21,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 142 transitions. [2022-04-15 12:24:21,819 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-15 12:24:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2022-04-15 12:24:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-15 12:24:21,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:21,820 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:21,837 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-15 12:24:22,027 WARN L460 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-15 12:24:22,027 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash -627392473, now seen corresponding path program 121 times [2022-04-15 12:24:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:22,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583765736] [2022-04-15 12:24:22,031 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:24:22,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:24:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -627392473, now seen corresponding path program 122 times [2022-04-15 12:24:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582225235] [2022-04-15 12:24:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:23,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {95239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {95173#true} is VALID [2022-04-15 12:24:23,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 12:24:23,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 12:24:23,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {95173#true} call ULTIMATE.init(); {95239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:23,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {95239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {95173#true} is VALID [2022-04-15 12:24:23,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 12:24:23,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 12:24:23,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {95173#true} call #t~ret5 := main(); {95173#true} is VALID [2022-04-15 12:24:23,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {95173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95178#(= main_~i~0 0)} is VALID [2022-04-15 12:24:23,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {95178#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95178#(= main_~i~0 0)} is VALID [2022-04-15 12:24:23,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {95178#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:23,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {95179#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:23,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {95179#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:23,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {95180#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:23,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {95180#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:23,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {95181#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:23,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {95181#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:23,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {95182#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:23,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {95182#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:23,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {95183#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:23,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {95183#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:23,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {95184#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:23,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {95184#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:23,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {95185#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:23,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {95185#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:23,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {95186#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:23,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {95186#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:23,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {95187#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:23,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {95187#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:23,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {95188#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:23,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {95188#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:23,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {95189#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:23,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {95189#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:23,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {95190#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:23,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {95190#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:23,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {95191#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:23,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {95191#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:23,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {95192#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:23,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {95192#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:23,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {95193#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:23,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {95193#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:23,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {95194#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:23,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {95194#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:23,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {95195#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:23,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {95195#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:23,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {95196#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:23,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {95196#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:23,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {95197#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:23,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {95197#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:23,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {95198#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:23,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {95198#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:23,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {95199#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:23,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {95199#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:23,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {95200#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:23,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {95200#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:23,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {95201#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:23,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {95201#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:23,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {95202#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:23,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {95202#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:23,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {95203#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:23,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {95203#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:23,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {95204#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:23,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {95204#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:23,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {95205#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:23,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {95205#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:23,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {95206#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:23,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {95206#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:23,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {95207#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:23,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {95207#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:23,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {95208#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:23,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {95208#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:23,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {95209#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:23,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {95209#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:23,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {95210#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:23,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {95210#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:23,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {95211#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:23,391 INFO L290 TraceCheckUtils]: 73: Hoare triple {95211#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:23,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {95212#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:23,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {95212#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:23,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {95213#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:23,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {95213#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:23,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {95214#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:23,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {95214#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:23,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {95215#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:23,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {95215#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:23,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {95216#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:23,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {95216#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:23,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {95217#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:23,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {95217#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:23,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {95218#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:23,396 INFO L290 TraceCheckUtils]: 87: Hoare triple {95218#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:23,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {95219#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:23,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {95219#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:23,397 INFO L290 TraceCheckUtils]: 90: Hoare triple {95220#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:23,397 INFO L290 TraceCheckUtils]: 91: Hoare triple {95220#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:23,397 INFO L290 TraceCheckUtils]: 92: Hoare triple {95221#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:23,398 INFO L290 TraceCheckUtils]: 93: Hoare triple {95221#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:23,398 INFO L290 TraceCheckUtils]: 94: Hoare triple {95222#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:23,398 INFO L290 TraceCheckUtils]: 95: Hoare triple {95222#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:23,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {95223#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:23,399 INFO L290 TraceCheckUtils]: 97: Hoare triple {95223#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:23,399 INFO L290 TraceCheckUtils]: 98: Hoare triple {95224#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:23,399 INFO L290 TraceCheckUtils]: 99: Hoare triple {95224#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:23,400 INFO L290 TraceCheckUtils]: 100: Hoare triple {95225#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:23,400 INFO L290 TraceCheckUtils]: 101: Hoare triple {95225#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:23,400 INFO L290 TraceCheckUtils]: 102: Hoare triple {95226#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:23,401 INFO L290 TraceCheckUtils]: 103: Hoare triple {95226#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:23,401 INFO L290 TraceCheckUtils]: 104: Hoare triple {95227#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:23,401 INFO L290 TraceCheckUtils]: 105: Hoare triple {95227#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:23,402 INFO L290 TraceCheckUtils]: 106: Hoare triple {95228#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:23,402 INFO L290 TraceCheckUtils]: 107: Hoare triple {95228#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:23,402 INFO L290 TraceCheckUtils]: 108: Hoare triple {95229#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:23,403 INFO L290 TraceCheckUtils]: 109: Hoare triple {95229#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:23,403 INFO L290 TraceCheckUtils]: 110: Hoare triple {95230#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:23,403 INFO L290 TraceCheckUtils]: 111: Hoare triple {95230#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:23,403 INFO L290 TraceCheckUtils]: 112: Hoare triple {95231#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:23,404 INFO L290 TraceCheckUtils]: 113: Hoare triple {95231#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:23,404 INFO L290 TraceCheckUtils]: 114: Hoare triple {95232#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:23,404 INFO L290 TraceCheckUtils]: 115: Hoare triple {95232#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:23,405 INFO L290 TraceCheckUtils]: 116: Hoare triple {95233#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:23,405 INFO L290 TraceCheckUtils]: 117: Hoare triple {95233#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:23,405 INFO L290 TraceCheckUtils]: 118: Hoare triple {95234#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:23,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {95234#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:23,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {95235#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:23,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {95235#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:23,407 INFO L290 TraceCheckUtils]: 122: Hoare triple {95236#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:23,407 INFO L290 TraceCheckUtils]: 123: Hoare triple {95236#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:23,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {95237#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 125: Hoare triple {95237#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95238#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 126: Hoare triple {95238#(<= main_~i~0 60)} assume !(~i~0 < 1023); {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 127: Hoare triple {95174#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 128: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 129: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 130: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 131: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 133: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:23,408 INFO L290 TraceCheckUtils]: 135: Hoare triple {95174#false} assume !(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:23,409 INFO L272 TraceCheckUtils]: 136: Hoare triple {95174#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {95174#false} is VALID [2022-04-15 12:24:23,409 INFO L290 TraceCheckUtils]: 137: Hoare triple {95174#false} ~cond := #in~cond; {95174#false} is VALID [2022-04-15 12:24:23,409 INFO L290 TraceCheckUtils]: 138: Hoare triple {95174#false} assume 0 == ~cond; {95174#false} is VALID [2022-04-15 12:24:23,409 INFO L290 TraceCheckUtils]: 139: Hoare triple {95174#false} assume !false; {95174#false} is VALID [2022-04-15 12:24:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:23,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582225235] [2022-04-15 12:24:23,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582225235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:23,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078986831] [2022-04-15 12:24:23,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:24:23,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:23,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:23,411 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-15 12:24:23,411 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-15 12:24:23,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:24:23,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:23,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-15 12:24:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:23,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:24,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {95173#true} call ULTIMATE.init(); {95173#true} is VALID [2022-04-15 12:24:24,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {95173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {95173#true} is VALID [2022-04-15 12:24:24,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 12:24:24,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 12:24:24,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {95173#true} call #t~ret5 := main(); {95173#true} is VALID [2022-04-15 12:24:24,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {95173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95258#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:24,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {95258#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95258#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:24,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {95258#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:24,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {95179#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:24,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {95179#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:24,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {95180#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:24,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {95180#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:24,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {95181#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:24,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {95181#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:24,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {95182#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:24,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {95182#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:24,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {95183#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:24,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {95183#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:24,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {95184#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:24,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {95184#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:24,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {95185#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:24,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {95185#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:24,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {95186#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:24,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {95186#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:24,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {95187#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:24,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {95187#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:24,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {95188#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:24,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {95188#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:24,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {95189#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:24,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {95189#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:24,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {95190#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:24,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {95190#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:24,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {95191#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:24,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {95191#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:24,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {95192#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:24,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {95192#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:24,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {95193#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:24,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {95193#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:24,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {95194#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:24,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {95194#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:24,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {95195#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:24,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {95195#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:24,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {95196#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:24,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {95196#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:24,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {95197#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:24,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {95197#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:24,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {95198#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:24,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {95198#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:24,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {95199#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:24,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {95199#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:24,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {95200#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:24,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {95200#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:24,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {95201#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:24,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {95201#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:24,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {95202#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:24,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {95202#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:24,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {95203#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:24,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {95203#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:24,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {95204#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:24,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {95204#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:24,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {95205#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:24,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {95205#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:24,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {95206#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:24,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {95206#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:24,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {95207#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:24,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {95207#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:24,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {95208#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:24,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {95208#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:24,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {95209#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:24,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {95209#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:24,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {95210#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:24,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {95210#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:24,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {95211#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:24,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {95211#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:24,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {95212#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:24,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {95212#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:24,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {95213#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:24,628 INFO L290 TraceCheckUtils]: 77: Hoare triple {95213#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:24,628 INFO L290 TraceCheckUtils]: 78: Hoare triple {95214#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:24,628 INFO L290 TraceCheckUtils]: 79: Hoare triple {95214#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:24,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {95215#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:24,629 INFO L290 TraceCheckUtils]: 81: Hoare triple {95215#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:24,629 INFO L290 TraceCheckUtils]: 82: Hoare triple {95216#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:24,630 INFO L290 TraceCheckUtils]: 83: Hoare triple {95216#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:24,630 INFO L290 TraceCheckUtils]: 84: Hoare triple {95217#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:24,630 INFO L290 TraceCheckUtils]: 85: Hoare triple {95217#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:24,630 INFO L290 TraceCheckUtils]: 86: Hoare triple {95218#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:24,631 INFO L290 TraceCheckUtils]: 87: Hoare triple {95218#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:24,631 INFO L290 TraceCheckUtils]: 88: Hoare triple {95219#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:24,631 INFO L290 TraceCheckUtils]: 89: Hoare triple {95219#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:24,632 INFO L290 TraceCheckUtils]: 90: Hoare triple {95220#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:24,632 INFO L290 TraceCheckUtils]: 91: Hoare triple {95220#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:24,632 INFO L290 TraceCheckUtils]: 92: Hoare triple {95221#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:24,633 INFO L290 TraceCheckUtils]: 93: Hoare triple {95221#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:24,633 INFO L290 TraceCheckUtils]: 94: Hoare triple {95222#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:24,633 INFO L290 TraceCheckUtils]: 95: Hoare triple {95222#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:24,634 INFO L290 TraceCheckUtils]: 96: Hoare triple {95223#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:24,634 INFO L290 TraceCheckUtils]: 97: Hoare triple {95223#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:24,634 INFO L290 TraceCheckUtils]: 98: Hoare triple {95224#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:24,635 INFO L290 TraceCheckUtils]: 99: Hoare triple {95224#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:24,635 INFO L290 TraceCheckUtils]: 100: Hoare triple {95225#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:24,635 INFO L290 TraceCheckUtils]: 101: Hoare triple {95225#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:24,636 INFO L290 TraceCheckUtils]: 102: Hoare triple {95226#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:24,636 INFO L290 TraceCheckUtils]: 103: Hoare triple {95226#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:24,636 INFO L290 TraceCheckUtils]: 104: Hoare triple {95227#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:24,637 INFO L290 TraceCheckUtils]: 105: Hoare triple {95227#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:24,637 INFO L290 TraceCheckUtils]: 106: Hoare triple {95228#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:24,637 INFO L290 TraceCheckUtils]: 107: Hoare triple {95228#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:24,637 INFO L290 TraceCheckUtils]: 108: Hoare triple {95229#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:24,638 INFO L290 TraceCheckUtils]: 109: Hoare triple {95229#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:24,638 INFO L290 TraceCheckUtils]: 110: Hoare triple {95230#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:24,638 INFO L290 TraceCheckUtils]: 111: Hoare triple {95230#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:24,639 INFO L290 TraceCheckUtils]: 112: Hoare triple {95231#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:24,639 INFO L290 TraceCheckUtils]: 113: Hoare triple {95231#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:24,639 INFO L290 TraceCheckUtils]: 114: Hoare triple {95232#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:24,640 INFO L290 TraceCheckUtils]: 115: Hoare triple {95232#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:24,640 INFO L290 TraceCheckUtils]: 116: Hoare triple {95233#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:24,640 INFO L290 TraceCheckUtils]: 117: Hoare triple {95233#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:24,641 INFO L290 TraceCheckUtils]: 118: Hoare triple {95234#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:24,641 INFO L290 TraceCheckUtils]: 119: Hoare triple {95234#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:24,641 INFO L290 TraceCheckUtils]: 120: Hoare triple {95235#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:24,642 INFO L290 TraceCheckUtils]: 121: Hoare triple {95235#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:24,642 INFO L290 TraceCheckUtils]: 122: Hoare triple {95236#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:24,642 INFO L290 TraceCheckUtils]: 123: Hoare triple {95236#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:24,643 INFO L290 TraceCheckUtils]: 124: Hoare triple {95237#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:24,643 INFO L290 TraceCheckUtils]: 125: Hoare triple {95237#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95238#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:24,643 INFO L290 TraceCheckUtils]: 126: Hoare triple {95238#(<= main_~i~0 60)} assume !(~i~0 < 1023); {95174#false} is VALID [2022-04-15 12:24:24,643 INFO L290 TraceCheckUtils]: 127: Hoare triple {95174#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {95174#false} is VALID [2022-04-15 12:24:24,643 INFO L290 TraceCheckUtils]: 128: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:24,643 INFO L290 TraceCheckUtils]: 129: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 130: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 131: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 132: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 133: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 134: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 135: Hoare triple {95174#false} assume !(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L272 TraceCheckUtils]: 136: Hoare triple {95174#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 137: Hoare triple {95174#false} ~cond := #in~cond; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 138: Hoare triple {95174#false} assume 0 == ~cond; {95174#false} is VALID [2022-04-15 12:24:24,644 INFO L290 TraceCheckUtils]: 139: Hoare triple {95174#false} assume !false; {95174#false} is VALID [2022-04-15 12:24:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:24,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:28,735 INFO L290 TraceCheckUtils]: 139: Hoare triple {95174#false} assume !false; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 138: Hoare triple {95174#false} assume 0 == ~cond; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 137: Hoare triple {95174#false} ~cond := #in~cond; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L272 TraceCheckUtils]: 136: Hoare triple {95174#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 135: Hoare triple {95174#false} assume !(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 134: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 133: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 132: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 131: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 130: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 129: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 12:24:28,736 INFO L290 TraceCheckUtils]: 128: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 12:24:28,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {95174#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {95174#false} is VALID [2022-04-15 12:24:28,737 INFO L290 TraceCheckUtils]: 126: Hoare triple {95700#(< main_~i~0 1023)} assume !(~i~0 < 1023); {95174#false} is VALID [2022-04-15 12:24:28,737 INFO L290 TraceCheckUtils]: 125: Hoare triple {95704#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95700#(< main_~i~0 1023)} is VALID [2022-04-15 12:24:28,737 INFO L290 TraceCheckUtils]: 124: Hoare triple {95704#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95704#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:28,738 INFO L290 TraceCheckUtils]: 123: Hoare triple {95711#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95704#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:28,738 INFO L290 TraceCheckUtils]: 122: Hoare triple {95711#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95711#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:28,738 INFO L290 TraceCheckUtils]: 121: Hoare triple {95718#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95711#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:28,739 INFO L290 TraceCheckUtils]: 120: Hoare triple {95718#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95718#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:28,739 INFO L290 TraceCheckUtils]: 119: Hoare triple {95725#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95718#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:28,739 INFO L290 TraceCheckUtils]: 118: Hoare triple {95725#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95725#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:28,740 INFO L290 TraceCheckUtils]: 117: Hoare triple {95732#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95725#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:28,740 INFO L290 TraceCheckUtils]: 116: Hoare triple {95732#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95732#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:28,740 INFO L290 TraceCheckUtils]: 115: Hoare triple {95739#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95732#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:28,741 INFO L290 TraceCheckUtils]: 114: Hoare triple {95739#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95739#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:28,741 INFO L290 TraceCheckUtils]: 113: Hoare triple {95746#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95739#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:28,741 INFO L290 TraceCheckUtils]: 112: Hoare triple {95746#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95746#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:28,742 INFO L290 TraceCheckUtils]: 111: Hoare triple {95753#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95746#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:28,742 INFO L290 TraceCheckUtils]: 110: Hoare triple {95753#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95753#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:28,742 INFO L290 TraceCheckUtils]: 109: Hoare triple {95760#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95753#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:28,743 INFO L290 TraceCheckUtils]: 108: Hoare triple {95760#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95760#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:28,743 INFO L290 TraceCheckUtils]: 107: Hoare triple {95767#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95760#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:28,743 INFO L290 TraceCheckUtils]: 106: Hoare triple {95767#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95767#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:28,744 INFO L290 TraceCheckUtils]: 105: Hoare triple {95774#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95767#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:28,744 INFO L290 TraceCheckUtils]: 104: Hoare triple {95774#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95774#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:28,744 INFO L290 TraceCheckUtils]: 103: Hoare triple {95781#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95774#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:28,744 INFO L290 TraceCheckUtils]: 102: Hoare triple {95781#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95781#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:28,745 INFO L290 TraceCheckUtils]: 101: Hoare triple {95788#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95781#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:28,745 INFO L290 TraceCheckUtils]: 100: Hoare triple {95788#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95788#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:28,745 INFO L290 TraceCheckUtils]: 99: Hoare triple {95795#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95788#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:28,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {95795#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95795#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:28,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {95802#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95795#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:28,746 INFO L290 TraceCheckUtils]: 96: Hoare triple {95802#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95802#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:28,747 INFO L290 TraceCheckUtils]: 95: Hoare triple {95809#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95802#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:28,747 INFO L290 TraceCheckUtils]: 94: Hoare triple {95809#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95809#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:28,747 INFO L290 TraceCheckUtils]: 93: Hoare triple {95816#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95809#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:28,748 INFO L290 TraceCheckUtils]: 92: Hoare triple {95816#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95816#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:28,748 INFO L290 TraceCheckUtils]: 91: Hoare triple {95823#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95816#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:28,748 INFO L290 TraceCheckUtils]: 90: Hoare triple {95823#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95823#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:28,749 INFO L290 TraceCheckUtils]: 89: Hoare triple {95830#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95823#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:28,749 INFO L290 TraceCheckUtils]: 88: Hoare triple {95830#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95830#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:28,749 INFO L290 TraceCheckUtils]: 87: Hoare triple {95837#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95830#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:28,750 INFO L290 TraceCheckUtils]: 86: Hoare triple {95837#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95837#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:28,750 INFO L290 TraceCheckUtils]: 85: Hoare triple {95844#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95837#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:28,750 INFO L290 TraceCheckUtils]: 84: Hoare triple {95844#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95844#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:28,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {95851#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95844#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:28,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {95851#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95851#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:28,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {95858#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95851#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:28,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {95858#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95858#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:28,752 INFO L290 TraceCheckUtils]: 79: Hoare triple {95865#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95858#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:28,752 INFO L290 TraceCheckUtils]: 78: Hoare triple {95865#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95865#(< main_~i~0 999)} is VALID [2022-04-15 12:24:28,752 INFO L290 TraceCheckUtils]: 77: Hoare triple {95872#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95865#(< main_~i~0 999)} is VALID [2022-04-15 12:24:28,753 INFO L290 TraceCheckUtils]: 76: Hoare triple {95872#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95872#(< main_~i~0 998)} is VALID [2022-04-15 12:24:28,753 INFO L290 TraceCheckUtils]: 75: Hoare triple {95879#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95872#(< main_~i~0 998)} is VALID [2022-04-15 12:24:28,753 INFO L290 TraceCheckUtils]: 74: Hoare triple {95879#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95879#(< main_~i~0 997)} is VALID [2022-04-15 12:24:28,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {95886#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95879#(< main_~i~0 997)} is VALID [2022-04-15 12:24:28,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {95886#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95886#(< main_~i~0 996)} is VALID [2022-04-15 12:24:28,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {95893#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95886#(< main_~i~0 996)} is VALID [2022-04-15 12:24:28,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {95893#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95893#(< main_~i~0 995)} is VALID [2022-04-15 12:24:28,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {95900#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95893#(< main_~i~0 995)} is VALID [2022-04-15 12:24:28,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {95900#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95900#(< main_~i~0 994)} is VALID [2022-04-15 12:24:28,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {95907#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95900#(< main_~i~0 994)} is VALID [2022-04-15 12:24:28,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {95907#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95907#(< main_~i~0 993)} is VALID [2022-04-15 12:24:28,756 INFO L290 TraceCheckUtils]: 65: Hoare triple {95914#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95907#(< main_~i~0 993)} is VALID [2022-04-15 12:24:28,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {95914#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95914#(< main_~i~0 992)} is VALID [2022-04-15 12:24:28,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {95921#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95914#(< main_~i~0 992)} is VALID [2022-04-15 12:24:28,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {95921#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95921#(< main_~i~0 991)} is VALID [2022-04-15 12:24:28,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {95928#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95921#(< main_~i~0 991)} is VALID [2022-04-15 12:24:28,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {95928#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95928#(< main_~i~0 990)} is VALID [2022-04-15 12:24:28,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {95935#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95928#(< main_~i~0 990)} is VALID [2022-04-15 12:24:28,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {95935#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95935#(< main_~i~0 989)} is VALID [2022-04-15 12:24:28,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {95942#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95935#(< main_~i~0 989)} is VALID [2022-04-15 12:24:28,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {95942#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95942#(< main_~i~0 988)} is VALID [2022-04-15 12:24:28,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {95949#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95942#(< main_~i~0 988)} is VALID [2022-04-15 12:24:28,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {95949#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95949#(< main_~i~0 987)} is VALID [2022-04-15 12:24:28,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {95956#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95949#(< main_~i~0 987)} is VALID [2022-04-15 12:24:28,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {95956#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95956#(< main_~i~0 986)} is VALID [2022-04-15 12:24:28,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {95963#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95956#(< main_~i~0 986)} is VALID [2022-04-15 12:24:28,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {95963#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95963#(< main_~i~0 985)} is VALID [2022-04-15 12:24:28,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {95970#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95963#(< main_~i~0 985)} is VALID [2022-04-15 12:24:28,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {95970#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95970#(< main_~i~0 984)} is VALID [2022-04-15 12:24:28,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {95977#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95970#(< main_~i~0 984)} is VALID [2022-04-15 12:24:28,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {95977#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95977#(< main_~i~0 983)} is VALID [2022-04-15 12:24:28,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {95984#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95977#(< main_~i~0 983)} is VALID [2022-04-15 12:24:28,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {95984#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95984#(< main_~i~0 982)} is VALID [2022-04-15 12:24:28,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {95991#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95984#(< main_~i~0 982)} is VALID [2022-04-15 12:24:28,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {95991#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95991#(< main_~i~0 981)} is VALID [2022-04-15 12:24:28,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {95998#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95991#(< main_~i~0 981)} is VALID [2022-04-15 12:24:28,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {95998#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95998#(< main_~i~0 980)} is VALID [2022-04-15 12:24:28,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {96005#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95998#(< main_~i~0 980)} is VALID [2022-04-15 12:24:28,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {96005#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96005#(< main_~i~0 979)} is VALID [2022-04-15 12:24:28,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {96012#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96005#(< main_~i~0 979)} is VALID [2022-04-15 12:24:28,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {96012#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96012#(< main_~i~0 978)} is VALID [2022-04-15 12:24:28,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {96019#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96012#(< main_~i~0 978)} is VALID [2022-04-15 12:24:28,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {96019#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96019#(< main_~i~0 977)} is VALID [2022-04-15 12:24:28,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {96026#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96019#(< main_~i~0 977)} is VALID [2022-04-15 12:24:28,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {96026#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96026#(< main_~i~0 976)} is VALID [2022-04-15 12:24:28,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {96033#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96026#(< main_~i~0 976)} is VALID [2022-04-15 12:24:28,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {96033#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96033#(< main_~i~0 975)} is VALID [2022-04-15 12:24:28,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {96040#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96033#(< main_~i~0 975)} is VALID [2022-04-15 12:24:28,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {96040#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96040#(< main_~i~0 974)} is VALID [2022-04-15 12:24:28,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {96047#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96040#(< main_~i~0 974)} is VALID [2022-04-15 12:24:28,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {96047#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96047#(< main_~i~0 973)} is VALID [2022-04-15 12:24:28,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {96054#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96047#(< main_~i~0 973)} is VALID [2022-04-15 12:24:28,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {96054#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96054#(< main_~i~0 972)} is VALID [2022-04-15 12:24:28,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {96061#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96054#(< main_~i~0 972)} is VALID [2022-04-15 12:24:28,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {96061#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96061#(< main_~i~0 971)} is VALID [2022-04-15 12:24:28,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {96068#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96061#(< main_~i~0 971)} is VALID [2022-04-15 12:24:28,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {96068#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96068#(< main_~i~0 970)} is VALID [2022-04-15 12:24:28,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {96075#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96068#(< main_~i~0 970)} is VALID [2022-04-15 12:24:28,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {96075#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96075#(< main_~i~0 969)} is VALID [2022-04-15 12:24:28,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {96082#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96075#(< main_~i~0 969)} is VALID [2022-04-15 12:24:28,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {96082#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96082#(< main_~i~0 968)} is VALID [2022-04-15 12:24:28,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {96089#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96082#(< main_~i~0 968)} is VALID [2022-04-15 12:24:28,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {96089#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96089#(< main_~i~0 967)} is VALID [2022-04-15 12:24:28,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {96096#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96089#(< main_~i~0 967)} is VALID [2022-04-15 12:24:28,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {96096#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96096#(< main_~i~0 966)} is VALID [2022-04-15 12:24:28,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {96103#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96096#(< main_~i~0 966)} is VALID [2022-04-15 12:24:28,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {96103#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96103#(< main_~i~0 965)} is VALID [2022-04-15 12:24:28,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {96110#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96103#(< main_~i~0 965)} is VALID [2022-04-15 12:24:28,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {96110#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96110#(< main_~i~0 964)} is VALID [2022-04-15 12:24:28,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {96117#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96110#(< main_~i~0 964)} is VALID [2022-04-15 12:24:28,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {96117#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96117#(< main_~i~0 963)} is VALID [2022-04-15 12:24:28,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {95173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {96117#(< main_~i~0 963)} is VALID [2022-04-15 12:24:28,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {95173#true} call #t~ret5 := main(); {95173#true} is VALID [2022-04-15 12:24:28,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 12:24:28,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 12:24:28,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {95173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {95173#true} is VALID [2022-04-15 12:24:28,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {95173#true} call ULTIMATE.init(); {95173#true} is VALID [2022-04-15 12:24:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:28,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078986831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:28,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:28,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-15 12:24:28,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583765736] [2022-04-15 12:24:28,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583765736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:28,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:28,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 12:24:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601776397] [2022-04-15 12:24:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-15 12:24:28,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:28,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:28,861 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-15 12:24:28,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 12:24:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 12:24:28,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-15 12:24:28,863 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:41,924 INFO L93 Difference]: Finished difference Result 395 states and 456 transitions. [2022-04-15 12:24:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 12:24:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-15 12:24:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 451 transitions. [2022-04-15 12:24:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 451 transitions. [2022-04-15 12:24:41,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 451 transitions. [2022-04-15 12:24:42,239 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-15 12:24:42,244 INFO L225 Difference]: With dead ends: 395 [2022-04-15 12:24:42,244 INFO L226 Difference]: Without dead ends: 381 [2022-04-15 12:24:42,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-15 12:24:42,247 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 932 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:42,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 36 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:24:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-15 12:24:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 143. [2022-04-15 12:24:43,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:43,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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-15 12:24:43,189 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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-15 12:24:43,189 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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-15 12:24:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:43,194 INFO L93 Difference]: Finished difference Result 381 states and 441 transitions. [2022-04-15 12:24:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 441 transitions. [2022-04-15 12:24:43,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:43,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:43,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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 381 states. [2022-04-15 12:24:43,195 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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 381 states. [2022-04-15 12:24:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:43,200 INFO L93 Difference]: Finished difference Result 381 states and 441 transitions. [2022-04-15 12:24:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 441 transitions. [2022-04-15 12:24:43,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:43,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:43,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:43,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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-15 12:24:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-04-15 12:24:43,202 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2022-04-15 12:24:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:43,202 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-04-15 12:24:43,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:43,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 144 transitions. [2022-04-15 12:24:43,525 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-15 12:24:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-04-15 12:24:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-15 12:24:43,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:43,536 INFO L499 BasicCegarLoop]: trace histogram [61, 61, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:43,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-15 12:24:43,747 WARN L460 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-15 12:24:43,747 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 903876937, now seen corresponding path program 123 times [2022-04-15 12:24:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:43,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498061155] [2022-04-15 12:24:43,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:24:43,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:24:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 903876937, now seen corresponding path program 124 times [2022-04-15 12:24:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:43,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521830923] [2022-04-15 12:24:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:45,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {98168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {98101#true} is VALID [2022-04-15 12:24:45,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 12:24:45,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 12:24:45,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {98101#true} call ULTIMATE.init(); {98168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:45,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {98168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {98101#true} is VALID [2022-04-15 12:24:45,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 12:24:45,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 12:24:45,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {98101#true} call #t~ret5 := main(); {98101#true} is VALID [2022-04-15 12:24:45,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {98101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98106#(= main_~i~0 0)} is VALID [2022-04-15 12:24:45,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {98106#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98106#(= main_~i~0 0)} is VALID [2022-04-15 12:24:45,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {98106#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:45,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {98107#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:45,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {98107#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:45,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {98108#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:45,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {98108#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:45,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {98109#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:45,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {98109#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:45,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {98110#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:45,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {98110#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:45,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {98111#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:45,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {98111#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:45,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {98112#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:45,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {98112#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:45,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {98113#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:45,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {98113#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:45,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {98114#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:45,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {98114#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:45,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {98115#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:45,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {98115#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:45,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {98116#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:45,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {98116#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:45,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {98117#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:45,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {98117#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:45,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {98118#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:45,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {98118#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:45,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {98119#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:45,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {98119#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:45,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {98120#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:45,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {98120#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:45,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {98121#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:45,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {98121#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:45,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {98122#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:45,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {98122#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:45,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {98123#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:45,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {98123#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:45,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {98124#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:45,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {98124#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:45,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {98125#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:45,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {98125#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:45,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {98126#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:45,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {98126#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:45,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {98127#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:45,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {98127#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:45,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {98128#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:45,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {98128#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:45,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {98129#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:45,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {98129#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:45,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {98130#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:45,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {98130#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:45,123 INFO L290 TraceCheckUtils]: 56: Hoare triple {98131#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:45,123 INFO L290 TraceCheckUtils]: 57: Hoare triple {98131#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:45,124 INFO L290 TraceCheckUtils]: 58: Hoare triple {98132#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:45,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {98132#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:45,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {98133#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:45,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {98133#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:45,138 INFO L290 TraceCheckUtils]: 62: Hoare triple {98134#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:45,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {98134#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:45,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {98135#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:45,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {98135#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:45,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {98136#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:45,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {98136#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:45,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {98137#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:45,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {98137#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:45,141 INFO L290 TraceCheckUtils]: 70: Hoare triple {98138#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:45,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {98138#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:45,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {98139#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:45,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {98139#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:45,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {98140#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:45,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {98140#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:45,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {98141#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:45,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {98141#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:45,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {98142#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:45,144 INFO L290 TraceCheckUtils]: 79: Hoare triple {98142#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:45,145 INFO L290 TraceCheckUtils]: 80: Hoare triple {98143#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:45,145 INFO L290 TraceCheckUtils]: 81: Hoare triple {98143#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:45,145 INFO L290 TraceCheckUtils]: 82: Hoare triple {98144#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:45,146 INFO L290 TraceCheckUtils]: 83: Hoare triple {98144#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:45,146 INFO L290 TraceCheckUtils]: 84: Hoare triple {98145#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:45,146 INFO L290 TraceCheckUtils]: 85: Hoare triple {98145#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:45,146 INFO L290 TraceCheckUtils]: 86: Hoare triple {98146#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:45,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {98146#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:45,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {98147#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:45,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {98147#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:45,148 INFO L290 TraceCheckUtils]: 90: Hoare triple {98148#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:45,148 INFO L290 TraceCheckUtils]: 91: Hoare triple {98148#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:45,148 INFO L290 TraceCheckUtils]: 92: Hoare triple {98149#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:45,149 INFO L290 TraceCheckUtils]: 93: Hoare triple {98149#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:45,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {98150#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:45,149 INFO L290 TraceCheckUtils]: 95: Hoare triple {98150#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:45,150 INFO L290 TraceCheckUtils]: 96: Hoare triple {98151#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:45,150 INFO L290 TraceCheckUtils]: 97: Hoare triple {98151#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:45,150 INFO L290 TraceCheckUtils]: 98: Hoare triple {98152#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:45,151 INFO L290 TraceCheckUtils]: 99: Hoare triple {98152#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:45,151 INFO L290 TraceCheckUtils]: 100: Hoare triple {98153#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:45,151 INFO L290 TraceCheckUtils]: 101: Hoare triple {98153#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:45,152 INFO L290 TraceCheckUtils]: 102: Hoare triple {98154#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:45,152 INFO L290 TraceCheckUtils]: 103: Hoare triple {98154#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:45,152 INFO L290 TraceCheckUtils]: 104: Hoare triple {98155#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:45,153 INFO L290 TraceCheckUtils]: 105: Hoare triple {98155#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:45,153 INFO L290 TraceCheckUtils]: 106: Hoare triple {98156#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:45,153 INFO L290 TraceCheckUtils]: 107: Hoare triple {98156#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:45,154 INFO L290 TraceCheckUtils]: 108: Hoare triple {98157#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:45,154 INFO L290 TraceCheckUtils]: 109: Hoare triple {98157#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:45,154 INFO L290 TraceCheckUtils]: 110: Hoare triple {98158#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:45,155 INFO L290 TraceCheckUtils]: 111: Hoare triple {98158#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:45,155 INFO L290 TraceCheckUtils]: 112: Hoare triple {98159#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:45,155 INFO L290 TraceCheckUtils]: 113: Hoare triple {98159#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:45,156 INFO L290 TraceCheckUtils]: 114: Hoare triple {98160#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:45,156 INFO L290 TraceCheckUtils]: 115: Hoare triple {98160#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:45,156 INFO L290 TraceCheckUtils]: 116: Hoare triple {98161#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:45,157 INFO L290 TraceCheckUtils]: 117: Hoare triple {98161#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:45,157 INFO L290 TraceCheckUtils]: 118: Hoare triple {98162#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:45,157 INFO L290 TraceCheckUtils]: 119: Hoare triple {98162#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:45,157 INFO L290 TraceCheckUtils]: 120: Hoare triple {98163#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:45,158 INFO L290 TraceCheckUtils]: 121: Hoare triple {98163#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:45,158 INFO L290 TraceCheckUtils]: 122: Hoare triple {98164#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:45,158 INFO L290 TraceCheckUtils]: 123: Hoare triple {98164#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:45,159 INFO L290 TraceCheckUtils]: 124: Hoare triple {98165#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:45,159 INFO L290 TraceCheckUtils]: 125: Hoare triple {98165#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:45,159 INFO L290 TraceCheckUtils]: 126: Hoare triple {98166#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 127: Hoare triple {98166#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98167#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 128: Hoare triple {98167#(<= main_~i~0 61)} assume !(~i~0 < 1023); {98102#false} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 129: Hoare triple {98102#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {98102#false} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 130: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 131: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 132: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 133: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:45,160 INFO L290 TraceCheckUtils]: 134: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L290 TraceCheckUtils]: 135: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L290 TraceCheckUtils]: 136: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L290 TraceCheckUtils]: 137: Hoare triple {98102#false} assume !(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L272 TraceCheckUtils]: 138: Hoare triple {98102#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L290 TraceCheckUtils]: 139: Hoare triple {98102#false} ~cond := #in~cond; {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L290 TraceCheckUtils]: 140: Hoare triple {98102#false} assume 0 == ~cond; {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L290 TraceCheckUtils]: 141: Hoare triple {98102#false} assume !false; {98102#false} is VALID [2022-04-15 12:24:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:45,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521830923] [2022-04-15 12:24:45,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521830923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:45,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714254423] [2022-04-15 12:24:45,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:24:45,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:45,164 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-15 12:24:45,165 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-15 12:24:45,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:24:45,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:45,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:24:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:45,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:46,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {98101#true} call ULTIMATE.init(); {98101#true} is VALID [2022-04-15 12:24:46,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {98101#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {98101#true} is VALID [2022-04-15 12:24:46,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 12:24:46,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 12:24:46,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {98101#true} call #t~ret5 := main(); {98101#true} is VALID [2022-04-15 12:24:46,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {98101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98187#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:46,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {98187#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98187#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:46,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {98187#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:46,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {98107#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:46,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {98107#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:46,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {98108#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:46,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {98108#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:46,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {98109#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:46,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {98109#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:46,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {98110#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:46,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {98110#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:46,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {98111#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:46,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {98111#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:46,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {98112#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:46,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {98112#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:46,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {98113#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:46,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {98113#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:46,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {98114#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:46,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {98114#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:46,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {98115#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:46,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {98115#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:46,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {98116#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:46,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {98116#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:46,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {98117#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:46,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {98117#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:46,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {98118#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:46,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {98118#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:46,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {98119#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:46,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {98119#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:46,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {98120#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:46,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {98120#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:46,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {98121#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:46,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {98121#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:46,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {98122#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:46,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {98122#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:46,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {98123#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:46,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {98123#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:46,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {98124#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:46,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {98124#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:46,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {98125#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:46,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {98125#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:46,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {98126#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:46,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {98126#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:46,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {98127#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:46,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {98127#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:46,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {98128#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:46,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {98128#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:46,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {98129#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:46,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {98129#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:46,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {98130#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:46,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {98130#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:46,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {98131#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:46,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {98131#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:46,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {98132#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:46,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {98132#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:46,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {98133#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:46,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {98133#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:46,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {98134#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:46,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {98134#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:46,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {98135#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:46,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {98135#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:46,465 INFO L290 TraceCheckUtils]: 66: Hoare triple {98136#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:46,465 INFO L290 TraceCheckUtils]: 67: Hoare triple {98136#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:46,466 INFO L290 TraceCheckUtils]: 68: Hoare triple {98137#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:46,466 INFO L290 TraceCheckUtils]: 69: Hoare triple {98137#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:46,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {98138#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:46,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {98138#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:46,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {98139#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:46,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {98139#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:46,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {98140#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:46,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {98140#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:46,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {98141#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:46,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {98141#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:46,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {98142#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:46,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {98142#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:46,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {98143#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:46,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {98143#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:46,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {98144#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:46,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {98144#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:46,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {98145#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:46,474 INFO L290 TraceCheckUtils]: 85: Hoare triple {98145#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:46,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {98146#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:46,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {98146#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:46,475 INFO L290 TraceCheckUtils]: 88: Hoare triple {98147#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:46,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {98147#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:46,476 INFO L290 TraceCheckUtils]: 90: Hoare triple {98148#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:46,476 INFO L290 TraceCheckUtils]: 91: Hoare triple {98148#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:46,477 INFO L290 TraceCheckUtils]: 92: Hoare triple {98149#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:46,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {98149#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:46,478 INFO L290 TraceCheckUtils]: 94: Hoare triple {98150#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:46,478 INFO L290 TraceCheckUtils]: 95: Hoare triple {98150#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:46,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {98151#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:46,479 INFO L290 TraceCheckUtils]: 97: Hoare triple {98151#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:46,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {98152#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:46,480 INFO L290 TraceCheckUtils]: 99: Hoare triple {98152#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:46,480 INFO L290 TraceCheckUtils]: 100: Hoare triple {98153#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:46,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {98153#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:46,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {98154#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:46,482 INFO L290 TraceCheckUtils]: 103: Hoare triple {98154#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:46,482 INFO L290 TraceCheckUtils]: 104: Hoare triple {98155#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:46,483 INFO L290 TraceCheckUtils]: 105: Hoare triple {98155#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:46,483 INFO L290 TraceCheckUtils]: 106: Hoare triple {98156#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:46,483 INFO L290 TraceCheckUtils]: 107: Hoare triple {98156#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:46,484 INFO L290 TraceCheckUtils]: 108: Hoare triple {98157#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:46,484 INFO L290 TraceCheckUtils]: 109: Hoare triple {98157#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:46,485 INFO L290 TraceCheckUtils]: 110: Hoare triple {98158#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:46,485 INFO L290 TraceCheckUtils]: 111: Hoare triple {98158#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:46,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {98159#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:46,486 INFO L290 TraceCheckUtils]: 113: Hoare triple {98159#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:46,487 INFO L290 TraceCheckUtils]: 114: Hoare triple {98160#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:46,487 INFO L290 TraceCheckUtils]: 115: Hoare triple {98160#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:46,488 INFO L290 TraceCheckUtils]: 116: Hoare triple {98161#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:46,488 INFO L290 TraceCheckUtils]: 117: Hoare triple {98161#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:46,489 INFO L290 TraceCheckUtils]: 118: Hoare triple {98162#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:46,489 INFO L290 TraceCheckUtils]: 119: Hoare triple {98162#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:46,489 INFO L290 TraceCheckUtils]: 120: Hoare triple {98163#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:46,490 INFO L290 TraceCheckUtils]: 121: Hoare triple {98163#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:46,490 INFO L290 TraceCheckUtils]: 122: Hoare triple {98164#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:46,491 INFO L290 TraceCheckUtils]: 123: Hoare triple {98164#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:46,491 INFO L290 TraceCheckUtils]: 124: Hoare triple {98165#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:46,491 INFO L290 TraceCheckUtils]: 125: Hoare triple {98165#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:46,492 INFO L290 TraceCheckUtils]: 126: Hoare triple {98166#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:46,492 INFO L290 TraceCheckUtils]: 127: Hoare triple {98166#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98167#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:46,492 INFO L290 TraceCheckUtils]: 128: Hoare triple {98167#(<= main_~i~0 61)} assume !(~i~0 < 1023); {98102#false} is VALID [2022-04-15 12:24:46,492 INFO L290 TraceCheckUtils]: 129: Hoare triple {98102#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {98102#false} is VALID [2022-04-15 12:24:46,492 INFO L290 TraceCheckUtils]: 130: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:46,492 INFO L290 TraceCheckUtils]: 131: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 132: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 133: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 134: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 135: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 136: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 137: Hoare triple {98102#false} assume !(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L272 TraceCheckUtils]: 138: Hoare triple {98102#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 139: Hoare triple {98102#false} ~cond := #in~cond; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 140: Hoare triple {98102#false} assume 0 == ~cond; {98102#false} is VALID [2022-04-15 12:24:46,493 INFO L290 TraceCheckUtils]: 141: Hoare triple {98102#false} assume !false; {98102#false} is VALID [2022-04-15 12:24:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:46,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:50,722 INFO L290 TraceCheckUtils]: 141: Hoare triple {98102#false} assume !false; {98102#false} is VALID [2022-04-15 12:24:50,722 INFO L290 TraceCheckUtils]: 140: Hoare triple {98102#false} assume 0 == ~cond; {98102#false} is VALID [2022-04-15 12:24:50,722 INFO L290 TraceCheckUtils]: 139: Hoare triple {98102#false} ~cond := #in~cond; {98102#false} is VALID [2022-04-15 12:24:50,722 INFO L272 TraceCheckUtils]: 138: Hoare triple {98102#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 137: Hoare triple {98102#false} assume !(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 136: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 135: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 134: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 133: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 132: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 131: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 130: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 129: Hoare triple {98102#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {98102#false} is VALID [2022-04-15 12:24:50,723 INFO L290 TraceCheckUtils]: 128: Hoare triple {98635#(< main_~i~0 1023)} assume !(~i~0 < 1023); {98102#false} is VALID [2022-04-15 12:24:50,724 INFO L290 TraceCheckUtils]: 127: Hoare triple {98639#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98635#(< main_~i~0 1023)} is VALID [2022-04-15 12:24:50,724 INFO L290 TraceCheckUtils]: 126: Hoare triple {98639#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98639#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:50,725 INFO L290 TraceCheckUtils]: 125: Hoare triple {98646#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98639#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:50,725 INFO L290 TraceCheckUtils]: 124: Hoare triple {98646#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98646#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:50,725 INFO L290 TraceCheckUtils]: 123: Hoare triple {98653#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98646#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:50,726 INFO L290 TraceCheckUtils]: 122: Hoare triple {98653#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98653#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:50,726 INFO L290 TraceCheckUtils]: 121: Hoare triple {98660#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98653#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:50,726 INFO L290 TraceCheckUtils]: 120: Hoare triple {98660#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98660#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:50,727 INFO L290 TraceCheckUtils]: 119: Hoare triple {98667#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98660#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:50,727 INFO L290 TraceCheckUtils]: 118: Hoare triple {98667#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98667#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:50,727 INFO L290 TraceCheckUtils]: 117: Hoare triple {98674#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98667#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:50,728 INFO L290 TraceCheckUtils]: 116: Hoare triple {98674#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98674#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:50,728 INFO L290 TraceCheckUtils]: 115: Hoare triple {98681#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98674#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:50,728 INFO L290 TraceCheckUtils]: 114: Hoare triple {98681#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98681#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:50,729 INFO L290 TraceCheckUtils]: 113: Hoare triple {98688#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98681#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:50,729 INFO L290 TraceCheckUtils]: 112: Hoare triple {98688#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98688#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:50,730 INFO L290 TraceCheckUtils]: 111: Hoare triple {98695#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98688#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:50,730 INFO L290 TraceCheckUtils]: 110: Hoare triple {98695#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98695#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:50,730 INFO L290 TraceCheckUtils]: 109: Hoare triple {98702#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98695#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:50,731 INFO L290 TraceCheckUtils]: 108: Hoare triple {98702#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98702#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:50,731 INFO L290 TraceCheckUtils]: 107: Hoare triple {98709#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98702#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:50,731 INFO L290 TraceCheckUtils]: 106: Hoare triple {98709#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98709#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:50,732 INFO L290 TraceCheckUtils]: 105: Hoare triple {98716#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98709#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:50,732 INFO L290 TraceCheckUtils]: 104: Hoare triple {98716#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98716#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:50,732 INFO L290 TraceCheckUtils]: 103: Hoare triple {98723#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98716#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:50,733 INFO L290 TraceCheckUtils]: 102: Hoare triple {98723#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98723#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:50,733 INFO L290 TraceCheckUtils]: 101: Hoare triple {98730#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98723#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:50,733 INFO L290 TraceCheckUtils]: 100: Hoare triple {98730#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98730#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:50,734 INFO L290 TraceCheckUtils]: 99: Hoare triple {98737#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98730#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:50,734 INFO L290 TraceCheckUtils]: 98: Hoare triple {98737#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98737#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:50,734 INFO L290 TraceCheckUtils]: 97: Hoare triple {98744#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98737#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:50,735 INFO L290 TraceCheckUtils]: 96: Hoare triple {98744#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98744#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:50,735 INFO L290 TraceCheckUtils]: 95: Hoare triple {98751#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98744#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:50,735 INFO L290 TraceCheckUtils]: 94: Hoare triple {98751#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98751#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:50,736 INFO L290 TraceCheckUtils]: 93: Hoare triple {98758#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98751#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:50,736 INFO L290 TraceCheckUtils]: 92: Hoare triple {98758#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98758#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:50,737 INFO L290 TraceCheckUtils]: 91: Hoare triple {98765#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98758#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:50,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {98765#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98765#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:50,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {98772#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98765#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:50,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {98772#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98772#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:50,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {98779#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98772#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:50,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {98779#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98779#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:50,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {98786#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98779#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:50,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {98786#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98786#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:50,739 INFO L290 TraceCheckUtils]: 83: Hoare triple {98793#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98786#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:50,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {98793#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98793#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:50,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {98800#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98793#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:50,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {98800#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98800#(< main_~i~0 999)} is VALID [2022-04-15 12:24:50,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {98807#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98800#(< main_~i~0 999)} is VALID [2022-04-15 12:24:50,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {98807#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98807#(< main_~i~0 998)} is VALID [2022-04-15 12:24:50,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {98814#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98807#(< main_~i~0 998)} is VALID [2022-04-15 12:24:50,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {98814#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98814#(< main_~i~0 997)} is VALID [2022-04-15 12:24:50,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {98821#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98814#(< main_~i~0 997)} is VALID [2022-04-15 12:24:50,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {98821#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98821#(< main_~i~0 996)} is VALID [2022-04-15 12:24:50,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {98828#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98821#(< main_~i~0 996)} is VALID [2022-04-15 12:24:50,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {98828#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98828#(< main_~i~0 995)} is VALID [2022-04-15 12:24:50,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {98835#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98828#(< main_~i~0 995)} is VALID [2022-04-15 12:24:50,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {98835#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98835#(< main_~i~0 994)} is VALID [2022-04-15 12:24:50,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {98842#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98835#(< main_~i~0 994)} is VALID [2022-04-15 12:24:50,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {98842#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98842#(< main_~i~0 993)} is VALID [2022-04-15 12:24:50,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {98849#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98842#(< main_~i~0 993)} is VALID [2022-04-15 12:24:50,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {98849#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98849#(< main_~i~0 992)} is VALID [2022-04-15 12:24:50,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {98856#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98849#(< main_~i~0 992)} is VALID [2022-04-15 12:24:50,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {98856#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98856#(< main_~i~0 991)} is VALID [2022-04-15 12:24:50,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {98863#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98856#(< main_~i~0 991)} is VALID [2022-04-15 12:24:50,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {98863#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98863#(< main_~i~0 990)} is VALID [2022-04-15 12:24:50,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {98870#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98863#(< main_~i~0 990)} is VALID [2022-04-15 12:24:50,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {98870#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98870#(< main_~i~0 989)} is VALID [2022-04-15 12:24:50,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {98877#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98870#(< main_~i~0 989)} is VALID [2022-04-15 12:24:50,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {98877#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98877#(< main_~i~0 988)} is VALID [2022-04-15 12:24:50,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {98884#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98877#(< main_~i~0 988)} is VALID [2022-04-15 12:24:50,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {98884#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98884#(< main_~i~0 987)} is VALID [2022-04-15 12:24:50,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {98891#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98884#(< main_~i~0 987)} is VALID [2022-04-15 12:24:50,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {98891#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98891#(< main_~i~0 986)} is VALID [2022-04-15 12:24:50,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {98898#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98891#(< main_~i~0 986)} is VALID [2022-04-15 12:24:50,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {98898#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98898#(< main_~i~0 985)} is VALID [2022-04-15 12:24:50,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {98905#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98898#(< main_~i~0 985)} is VALID [2022-04-15 12:24:50,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {98905#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98905#(< main_~i~0 984)} is VALID [2022-04-15 12:24:50,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {98912#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98905#(< main_~i~0 984)} is VALID [2022-04-15 12:24:50,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {98912#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98912#(< main_~i~0 983)} is VALID [2022-04-15 12:24:50,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {98919#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98912#(< main_~i~0 983)} is VALID [2022-04-15 12:24:50,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {98919#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98919#(< main_~i~0 982)} is VALID [2022-04-15 12:24:50,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {98926#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98919#(< main_~i~0 982)} is VALID [2022-04-15 12:24:50,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {98926#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98926#(< main_~i~0 981)} is VALID [2022-04-15 12:24:50,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {98933#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98926#(< main_~i~0 981)} is VALID [2022-04-15 12:24:50,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {98933#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98933#(< main_~i~0 980)} is VALID [2022-04-15 12:24:50,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {98940#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98933#(< main_~i~0 980)} is VALID [2022-04-15 12:24:50,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {98940#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98940#(< main_~i~0 979)} is VALID [2022-04-15 12:24:50,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {98947#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98940#(< main_~i~0 979)} is VALID [2022-04-15 12:24:50,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {98947#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98947#(< main_~i~0 978)} is VALID [2022-04-15 12:24:50,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {98954#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98947#(< main_~i~0 978)} is VALID [2022-04-15 12:24:50,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {98954#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98954#(< main_~i~0 977)} is VALID [2022-04-15 12:24:50,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {98961#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98954#(< main_~i~0 977)} is VALID [2022-04-15 12:24:50,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {98961#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98961#(< main_~i~0 976)} is VALID [2022-04-15 12:24:50,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {98968#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98961#(< main_~i~0 976)} is VALID [2022-04-15 12:24:50,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {98968#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98968#(< main_~i~0 975)} is VALID [2022-04-15 12:24:50,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {98975#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98968#(< main_~i~0 975)} is VALID [2022-04-15 12:24:50,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {98975#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98975#(< main_~i~0 974)} is VALID [2022-04-15 12:24:50,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {98982#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98975#(< main_~i~0 974)} is VALID [2022-04-15 12:24:50,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {98982#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98982#(< main_~i~0 973)} is VALID [2022-04-15 12:24:50,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {98989#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98982#(< main_~i~0 973)} is VALID [2022-04-15 12:24:50,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {98989#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98989#(< main_~i~0 972)} is VALID [2022-04-15 12:24:50,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {98996#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98989#(< main_~i~0 972)} is VALID [2022-04-15 12:24:50,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {98996#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98996#(< main_~i~0 971)} is VALID [2022-04-15 12:24:50,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {99003#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98996#(< main_~i~0 971)} is VALID [2022-04-15 12:24:50,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {99003#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99003#(< main_~i~0 970)} is VALID [2022-04-15 12:24:50,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {99010#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99003#(< main_~i~0 970)} is VALID [2022-04-15 12:24:50,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {99010#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99010#(< main_~i~0 969)} is VALID [2022-04-15 12:24:50,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {99017#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99010#(< main_~i~0 969)} is VALID [2022-04-15 12:24:50,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {99017#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99017#(< main_~i~0 968)} is VALID [2022-04-15 12:24:50,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {99024#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99017#(< main_~i~0 968)} is VALID [2022-04-15 12:24:50,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {99024#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99024#(< main_~i~0 967)} is VALID [2022-04-15 12:24:50,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {99031#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99024#(< main_~i~0 967)} is VALID [2022-04-15 12:24:50,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {99031#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99031#(< main_~i~0 966)} is VALID [2022-04-15 12:24:50,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {99038#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99031#(< main_~i~0 966)} is VALID [2022-04-15 12:24:50,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {99038#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99038#(< main_~i~0 965)} is VALID [2022-04-15 12:24:50,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {99045#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99038#(< main_~i~0 965)} is VALID [2022-04-15 12:24:50,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {99045#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99045#(< main_~i~0 964)} is VALID [2022-04-15 12:24:50,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {99052#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99045#(< main_~i~0 964)} is VALID [2022-04-15 12:24:50,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {99052#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99052#(< main_~i~0 963)} is VALID [2022-04-15 12:24:50,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {99059#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99052#(< main_~i~0 963)} is VALID [2022-04-15 12:24:50,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {99059#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99059#(< main_~i~0 962)} is VALID [2022-04-15 12:24:50,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {98101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {99059#(< main_~i~0 962)} is VALID [2022-04-15 12:24:50,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {98101#true} call #t~ret5 := main(); {98101#true} is VALID [2022-04-15 12:24:50,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 12:24:50,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 12:24:50,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {98101#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {98101#true} is VALID [2022-04-15 12:24:50,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {98101#true} call ULTIMATE.init(); {98101#true} is VALID [2022-04-15 12:24:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:24:50,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714254423] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:50,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:50,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-15 12:24:50,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:50,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498061155] [2022-04-15 12:24:50,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498061155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:50,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:50,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 12:24:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281503511] [2022-04-15 12:24:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2022-04-15 12:24:50,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:50,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:50,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:50,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 12:24:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:50,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 12:24:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 12:24:50,861 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:04,783 INFO L93 Difference]: Finished difference Result 401 states and 463 transitions. [2022-04-15 12:25:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 12:25:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2022-04-15 12:25:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 458 transitions. [2022-04-15 12:25:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 458 transitions. [2022-04-15 12:25:04,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 458 transitions. [2022-04-15 12:25:05,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:05,112 INFO L225 Difference]: With dead ends: 401 [2022-04-15 12:25:05,112 INFO L226 Difference]: Without dead ends: 387 [2022-04-15 12:25:05,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 12:25:05,115 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1053 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:05,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 41 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:25:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-15 12:25:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 145. [2022-04-15 12:25:06,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:06,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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-15 12:25:06,158 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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-15 12:25:06,158 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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-15 12:25:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:06,163 INFO L93 Difference]: Finished difference Result 387 states and 448 transitions. [2022-04-15 12:25:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 448 transitions. [2022-04-15 12:25:06,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:06,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:06,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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 387 states. [2022-04-15 12:25:06,164 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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 387 states. [2022-04-15 12:25:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:06,169 INFO L93 Difference]: Finished difference Result 387 states and 448 transitions. [2022-04-15 12:25:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 448 transitions. [2022-04-15 12:25:06,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:06,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:06,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:06,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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-15 12:25:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2022-04-15 12:25:06,171 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2022-04-15 12:25:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:06,171 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2022-04-15 12:25:06,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:06,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 146 transitions. [2022-04-15 12:25:06,507 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-15 12:25:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2022-04-15 12:25:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 12:25:06,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:06,508 INFO L499 BasicCegarLoop]: trace histogram [62, 62, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:06,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-15 12:25:06,708 WARN L460 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-15 12:25:06,708 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash -720002581, now seen corresponding path program 125 times [2022-04-15 12:25:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:06,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654233487] [2022-04-15 12:25:06,713 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:25:06,713 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:25:06,713 INFO L85 PathProgramCache]: Analyzing trace with hash -720002581, now seen corresponding path program 126 times [2022-04-15 12:25:06,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:06,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084554650] [2022-04-15 12:25:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:08,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {101141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {101073#true} is VALID [2022-04-15 12:25:08,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 12:25:08,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 12:25:08,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {101073#true} call ULTIMATE.init(); {101141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:08,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {101141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {101073#true} is VALID [2022-04-15 12:25:08,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 12:25:08,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 12:25:08,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {101073#true} call #t~ret5 := main(); {101073#true} is VALID [2022-04-15 12:25:08,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {101073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101078#(= main_~i~0 0)} is VALID [2022-04-15 12:25:08,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {101078#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101078#(= main_~i~0 0)} is VALID [2022-04-15 12:25:08,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {101078#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:08,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {101079#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:08,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {101079#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:08,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {101080#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:08,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {101080#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101081#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:08,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {101081#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101081#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:08,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {101081#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101082#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:08,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {101082#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101082#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:08,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {101082#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101083#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:08,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {101083#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101083#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:08,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {101083#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101084#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:08,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {101084#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101084#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:08,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {101084#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101085#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:08,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {101085#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101085#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:08,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {101085#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101086#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:08,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {101086#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101086#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:08,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {101086#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101087#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:08,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {101087#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101087#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:08,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {101087#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101088#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:08,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {101088#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101088#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:08,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {101088#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101089#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:08,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {101089#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101089#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:08,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {101089#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101090#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:08,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {101090#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101090#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:08,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {101090#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101091#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:08,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {101091#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101091#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:08,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {101091#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101092#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:08,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {101092#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101092#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:08,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {101092#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101093#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:08,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {101093#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101093#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:08,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {101093#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101094#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:08,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {101094#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101094#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:08,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {101094#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101095#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:08,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {101095#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101095#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:08,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {101095#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101096#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:08,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {101096#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101096#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:08,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {101096#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101097#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:08,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {101097#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101097#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:08,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {101097#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101098#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:08,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {101098#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101098#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:08,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {101098#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101099#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:08,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {101099#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101099#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:08,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {101099#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101100#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:08,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {101100#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101100#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:08,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {101100#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101101#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:08,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {101101#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101101#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:08,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {101101#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101102#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:08,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {101102#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101102#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:08,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {101102#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101103#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:08,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {101103#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101103#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:08,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {101103#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101104#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:08,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {101104#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101104#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:08,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {101104#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101105#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:08,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {101105#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101105#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:08,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {101105#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101106#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:08,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {101106#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101106#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:08,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {101106#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101107#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:08,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {101107#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101107#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:08,154 INFO L290 TraceCheckUtils]: 65: Hoare triple {101107#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101108#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:08,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {101108#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101108#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:08,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {101108#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101109#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:08,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {101109#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101109#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:08,155 INFO L290 TraceCheckUtils]: 69: Hoare triple {101109#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101110#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:08,155 INFO L290 TraceCheckUtils]: 70: Hoare triple {101110#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101110#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:08,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {101110#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101111#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:08,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {101111#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101111#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:08,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {101111#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101112#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:08,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {101112#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101112#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:08,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {101112#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101113#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:08,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {101113#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101113#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:08,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {101113#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101114#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:08,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {101114#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101114#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:08,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {101114#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101115#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:08,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {101115#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101115#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:08,159 INFO L290 TraceCheckUtils]: 81: Hoare triple {101115#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101116#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:08,159 INFO L290 TraceCheckUtils]: 82: Hoare triple {101116#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101116#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:08,159 INFO L290 TraceCheckUtils]: 83: Hoare triple {101116#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101117#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:08,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {101117#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101117#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:08,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {101117#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101118#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:08,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {101118#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101118#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:08,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {101118#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101119#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:08,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {101119#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101119#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:08,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {101119#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101120#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:08,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {101120#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101120#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:08,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {101120#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101121#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:08,162 INFO L290 TraceCheckUtils]: 92: Hoare triple {101121#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101121#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:08,163 INFO L290 TraceCheckUtils]: 93: Hoare triple {101121#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101122#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:08,163 INFO L290 TraceCheckUtils]: 94: Hoare triple {101122#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101122#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:08,163 INFO L290 TraceCheckUtils]: 95: Hoare triple {101122#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101123#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:08,164 INFO L290 TraceCheckUtils]: 96: Hoare triple {101123#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101123#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:08,164 INFO L290 TraceCheckUtils]: 97: Hoare triple {101123#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101124#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:08,164 INFO L290 TraceCheckUtils]: 98: Hoare triple {101124#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101124#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:08,165 INFO L290 TraceCheckUtils]: 99: Hoare triple {101124#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101125#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:08,165 INFO L290 TraceCheckUtils]: 100: Hoare triple {101125#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101125#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:08,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {101125#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101126#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:08,166 INFO L290 TraceCheckUtils]: 102: Hoare triple {101126#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101126#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:08,166 INFO L290 TraceCheckUtils]: 103: Hoare triple {101126#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101127#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:08,166 INFO L290 TraceCheckUtils]: 104: Hoare triple {101127#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101127#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:08,166 INFO L290 TraceCheckUtils]: 105: Hoare triple {101127#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101128#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:08,167 INFO L290 TraceCheckUtils]: 106: Hoare triple {101128#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101128#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:08,167 INFO L290 TraceCheckUtils]: 107: Hoare triple {101128#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101129#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:08,167 INFO L290 TraceCheckUtils]: 108: Hoare triple {101129#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101129#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:08,168 INFO L290 TraceCheckUtils]: 109: Hoare triple {101129#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101130#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:08,168 INFO L290 TraceCheckUtils]: 110: Hoare triple {101130#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101130#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:08,168 INFO L290 TraceCheckUtils]: 111: Hoare triple {101130#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101131#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:08,169 INFO L290 TraceCheckUtils]: 112: Hoare triple {101131#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101131#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:08,169 INFO L290 TraceCheckUtils]: 113: Hoare triple {101131#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101132#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:08,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {101132#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101132#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:08,170 INFO L290 TraceCheckUtils]: 115: Hoare triple {101132#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101133#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:08,170 INFO L290 TraceCheckUtils]: 116: Hoare triple {101133#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101133#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:08,170 INFO L290 TraceCheckUtils]: 117: Hoare triple {101133#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101134#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:08,171 INFO L290 TraceCheckUtils]: 118: Hoare triple {101134#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101134#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:08,171 INFO L290 TraceCheckUtils]: 119: Hoare triple {101134#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101135#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:08,171 INFO L290 TraceCheckUtils]: 120: Hoare triple {101135#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101135#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:08,172 INFO L290 TraceCheckUtils]: 121: Hoare triple {101135#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101136#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:08,172 INFO L290 TraceCheckUtils]: 122: Hoare triple {101136#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101136#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:08,172 INFO L290 TraceCheckUtils]: 123: Hoare triple {101136#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101137#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:08,172 INFO L290 TraceCheckUtils]: 124: Hoare triple {101137#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101137#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:08,173 INFO L290 TraceCheckUtils]: 125: Hoare triple {101137#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101138#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:08,173 INFO L290 TraceCheckUtils]: 126: Hoare triple {101138#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101138#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:08,173 INFO L290 TraceCheckUtils]: 127: Hoare triple {101138#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101139#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:08,174 INFO L290 TraceCheckUtils]: 128: Hoare triple {101139#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101139#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:08,174 INFO L290 TraceCheckUtils]: 129: Hoare triple {101139#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101140#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:08,174 INFO L290 TraceCheckUtils]: 130: Hoare triple {101140#(<= main_~i~0 62)} assume !(~i~0 < 1023); {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 131: Hoare triple {101074#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 132: Hoare triple {101074#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 133: Hoare triple {101074#false} assume !!(0 != #t~mem4);havoc #t~mem4; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 134: Hoare triple {101074#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 135: Hoare triple {101074#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 136: Hoare triple {101074#false} assume !!(0 != #t~mem4);havoc #t~mem4; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 137: Hoare triple {101074#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 138: Hoare triple {101074#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 139: Hoare triple {101074#false} assume !(0 != #t~mem4);havoc #t~mem4; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L272 TraceCheckUtils]: 140: Hoare triple {101074#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 141: Hoare triple {101074#false} ~cond := #in~cond; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 142: Hoare triple {101074#false} assume 0 == ~cond; {101074#false} is VALID [2022-04-15 12:25:08,175 INFO L290 TraceCheckUtils]: 143: Hoare triple {101074#false} assume !false; {101074#false} is VALID [2022-04-15 12:25:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:08,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084554650] [2022-04-15 12:25:08,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084554650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:08,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474997784] [2022-04-15 12:25:08,176 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:25:08,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:08,177 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-15 12:25:08,178 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-15 12:25:08,575 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:25:08,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:08,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:25:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:08,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:08,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {101073#true} call ULTIMATE.init(); {101073#true} is VALID [2022-04-15 12:25:08,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {101073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {101073#true} is VALID [2022-04-15 12:25:08,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {101073#true} call #t~ret5 := main(); {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {101073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 57: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 62: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,918 INFO L290 TraceCheckUtils]: 63: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 67: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 81: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 82: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 86: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 87: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 88: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 94: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 95: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 96: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 97: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 98: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 99: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 100: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 101: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 102: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 103: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 104: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 105: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 106: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 107: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,921 INFO L290 TraceCheckUtils]: 108: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 109: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 110: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 111: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 112: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 113: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 114: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 115: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 116: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 117: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 119: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 120: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 121: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 122: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 123: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,922 INFO L290 TraceCheckUtils]: 124: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 125: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 126: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 127: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 128: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 129: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 130: Hoare triple {101073#true} assume !(~i~0 < 1023); {101073#true} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 131: Hoare triple {101073#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {101538#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:08,923 INFO L290 TraceCheckUtils]: 132: Hoare triple {101538#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101538#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:08,924 INFO L290 TraceCheckUtils]: 133: Hoare triple {101538#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {101538#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:08,924 INFO L290 TraceCheckUtils]: 134: Hoare triple {101538#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:08,924 INFO L290 TraceCheckUtils]: 135: Hoare triple {101079#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101079#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:08,925 INFO L290 TraceCheckUtils]: 136: Hoare triple {101079#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:08,925 INFO L290 TraceCheckUtils]: 137: Hoare triple {101079#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:08,925 INFO L290 TraceCheckUtils]: 138: Hoare triple {101080#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101080#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:08,926 INFO L290 TraceCheckUtils]: 139: Hoare triple {101080#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:08,926 INFO L272 TraceCheckUtils]: 140: Hoare triple {101080#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:25:08,926 INFO L290 TraceCheckUtils]: 141: Hoare triple {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:25:08,927 INFO L290 TraceCheckUtils]: 142: Hoare triple {101570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101074#false} is VALID [2022-04-15 12:25:08,927 INFO L290 TraceCheckUtils]: 143: Hoare triple {101074#false} assume !false; {101074#false} is VALID [2022-04-15 12:25:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 12:25:08,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:09,294 INFO L290 TraceCheckUtils]: 143: Hoare triple {101074#false} assume !false; {101074#false} is VALID [2022-04-15 12:25:09,294 INFO L290 TraceCheckUtils]: 142: Hoare triple {101570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101074#false} is VALID [2022-04-15 12:25:09,295 INFO L290 TraceCheckUtils]: 141: Hoare triple {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:25:09,295 INFO L272 TraceCheckUtils]: 140: Hoare triple {101586#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:25:09,295 INFO L290 TraceCheckUtils]: 139: Hoare triple {101586#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {101586#(<= main_~i~0 1024)} is VALID [2022-04-15 12:25:09,296 INFO L290 TraceCheckUtils]: 138: Hoare triple {101586#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101586#(<= main_~i~0 1024)} is VALID [2022-04-15 12:25:09,296 INFO L290 TraceCheckUtils]: 137: Hoare triple {101596#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101586#(<= main_~i~0 1024)} is VALID [2022-04-15 12:25:09,296 INFO L290 TraceCheckUtils]: 136: Hoare triple {101596#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {101596#(<= main_~i~0 1023)} is VALID [2022-04-15 12:25:09,297 INFO L290 TraceCheckUtils]: 135: Hoare triple {101596#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101596#(<= main_~i~0 1023)} is VALID [2022-04-15 12:25:09,297 INFO L290 TraceCheckUtils]: 134: Hoare triple {101606#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101596#(<= main_~i~0 1023)} is VALID [2022-04-15 12:25:09,297 INFO L290 TraceCheckUtils]: 133: Hoare triple {101606#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {101606#(<= main_~i~0 1022)} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 132: Hoare triple {101606#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101606#(<= main_~i~0 1022)} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 131: Hoare triple {101073#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {101606#(<= main_~i~0 1022)} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 130: Hoare triple {101073#true} assume !(~i~0 < 1023); {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 129: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 128: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 127: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 126: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 125: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 124: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,298 INFO L290 TraceCheckUtils]: 123: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 122: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 121: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 120: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 119: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 118: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 117: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 116: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 115: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 114: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 113: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 112: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 111: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 110: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 109: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 108: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,299 INFO L290 TraceCheckUtils]: 107: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 106: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 105: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 104: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 103: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 100: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 99: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 98: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 97: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 96: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 95: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 94: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 93: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,300 INFO L290 TraceCheckUtils]: 92: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 91: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 90: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 89: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 87: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 81: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 80: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 76: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 75: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 74: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 73: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 72: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 71: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {101073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {101073#true} call #t~ret5 := main(); {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {101073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {101073#true} is VALID [2022-04-15 12:25:09,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {101073#true} call ULTIMATE.init(); {101073#true} is VALID [2022-04-15 12:25:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 12:25:09,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474997784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:09,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:09,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 7, 7] total 72 [2022-04-15 12:25:09,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:09,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654233487] [2022-04-15 12:25:09,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654233487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:09,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:09,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 12:25:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184748902] [2022-04-15 12:25:09,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:09,308 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-15 12:25:09,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:09,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:09,395 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-15 12:25:09,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 12:25:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:09,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 12:25:09,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=2760, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 12:25:09,397 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:23,337 INFO L93 Difference]: Finished difference Result 407 states and 470 transitions. [2022-04-15 12:25:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 12:25:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-15 12:25:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 465 transitions. [2022-04-15 12:25:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 465 transitions. [2022-04-15 12:25:23,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 465 transitions. [2022-04-15 12:25:23,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:23,670 INFO L225 Difference]: With dead ends: 407 [2022-04-15 12:25:23,670 INFO L226 Difference]: Without dead ends: 393 [2022-04-15 12:25:23,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6700, Invalid=11390, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 12:25:23,672 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 864 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:23,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [864 Valid, 61 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:25:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-15 12:25:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 147. [2022-04-15 12:25:24,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:24,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:24,741 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:24,741 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:24,749 INFO L93 Difference]: Finished difference Result 393 states and 455 transitions. [2022-04-15 12:25:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 455 transitions. [2022-04-15 12:25:24,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:24,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:24,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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 393 states. [2022-04-15 12:25:24,750 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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 393 states. [2022-04-15 12:25:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:24,757 INFO L93 Difference]: Finished difference Result 393 states and 455 transitions. [2022-04-15 12:25:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 455 transitions. [2022-04-15 12:25:24,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:24,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:24,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:24,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-15 12:25:24,760 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2022-04-15 12:25:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:24,761 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-15 12:25:24,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:24,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-15 12:25:25,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-15 12:25:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 12:25:25,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:25,105 INFO L499 BasicCegarLoop]: trace histogram [63, 63, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:25,122 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-15 12:25:25,305 WARN L460 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-15 12:25:25,305 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:25,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2099876365, now seen corresponding path program 127 times [2022-04-15 12:25:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:25,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59939435] [2022-04-15 12:25:25,309 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:25:25,310 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:25:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2099876365, now seen corresponding path program 128 times [2022-04-15 12:25:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:25,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198206563] [2022-04-15 12:25:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:26,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {104100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {104031#true} is VALID [2022-04-15 12:25:26,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 12:25:26,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 12:25:26,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {104031#true} call ULTIMATE.init(); {104100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:26,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {104100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {104031#true} is VALID [2022-04-15 12:25:26,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 12:25:26,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 12:25:26,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {104031#true} call #t~ret5 := main(); {104031#true} is VALID [2022-04-15 12:25:26,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {104031#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104036#(= main_~i~0 0)} is VALID [2022-04-15 12:25:26,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {104036#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104036#(= main_~i~0 0)} is VALID [2022-04-15 12:25:26,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {104036#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:26,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {104037#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:26,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {104037#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:26,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {104038#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:26,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {104038#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:26,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {104039#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:26,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {104039#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:26,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {104040#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:26,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {104040#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:26,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {104041#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:26,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {104041#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:26,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {104042#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:26,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {104042#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:26,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {104043#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:26,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {104043#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:26,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {104044#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:26,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {104044#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:26,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {104045#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:26,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {104045#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:26,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {104046#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:26,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {104046#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:26,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {104047#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:26,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {104047#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:26,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {104048#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:26,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {104048#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:26,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {104049#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:26,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {104049#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:26,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {104050#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:26,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {104050#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:26,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {104051#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:26,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {104051#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:26,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {104052#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:26,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {104052#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:26,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {104053#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:26,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {104053#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:26,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {104054#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:26,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {104054#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:26,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {104055#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:26,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {104055#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:26,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {104056#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:26,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {104056#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:26,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {104057#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:26,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {104057#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:26,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {104058#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:26,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {104058#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:26,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {104059#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:26,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {104059#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:26,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {104060#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:26,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {104060#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:26,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {104061#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:26,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {104061#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:26,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {104062#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:26,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {104062#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:26,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {104063#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:26,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {104063#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:26,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {104064#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:26,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {104064#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:26,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {104065#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:26,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {104065#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:26,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {104066#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:26,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {104066#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:26,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {104067#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:26,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {104067#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:26,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {104068#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:26,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {104068#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:26,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {104069#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:26,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {104069#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:26,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {104070#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:26,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {104070#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:26,777 INFO L290 TraceCheckUtils]: 76: Hoare triple {104071#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:26,777 INFO L290 TraceCheckUtils]: 77: Hoare triple {104071#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:26,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {104072#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:26,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {104072#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:26,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {104073#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:26,778 INFO L290 TraceCheckUtils]: 81: Hoare triple {104073#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:26,778 INFO L290 TraceCheckUtils]: 82: Hoare triple {104074#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:26,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {104074#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:26,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {104075#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:26,779 INFO L290 TraceCheckUtils]: 85: Hoare triple {104075#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:26,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {104076#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:26,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {104076#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:26,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {104077#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:26,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {104077#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:26,781 INFO L290 TraceCheckUtils]: 90: Hoare triple {104078#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:26,781 INFO L290 TraceCheckUtils]: 91: Hoare triple {104078#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:26,782 INFO L290 TraceCheckUtils]: 92: Hoare triple {104079#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:26,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {104079#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:26,782 INFO L290 TraceCheckUtils]: 94: Hoare triple {104080#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:26,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {104080#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:26,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {104081#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:26,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {104081#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:26,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {104082#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:26,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {104082#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:26,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {104083#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:26,784 INFO L290 TraceCheckUtils]: 101: Hoare triple {104083#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:26,785 INFO L290 TraceCheckUtils]: 102: Hoare triple {104084#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:26,785 INFO L290 TraceCheckUtils]: 103: Hoare triple {104084#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:26,785 INFO L290 TraceCheckUtils]: 104: Hoare triple {104085#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:26,786 INFO L290 TraceCheckUtils]: 105: Hoare triple {104085#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:26,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {104086#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:26,786 INFO L290 TraceCheckUtils]: 107: Hoare triple {104086#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:26,787 INFO L290 TraceCheckUtils]: 108: Hoare triple {104087#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:26,787 INFO L290 TraceCheckUtils]: 109: Hoare triple {104087#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:26,787 INFO L290 TraceCheckUtils]: 110: Hoare triple {104088#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:26,788 INFO L290 TraceCheckUtils]: 111: Hoare triple {104088#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:26,788 INFO L290 TraceCheckUtils]: 112: Hoare triple {104089#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:26,788 INFO L290 TraceCheckUtils]: 113: Hoare triple {104089#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:26,788 INFO L290 TraceCheckUtils]: 114: Hoare triple {104090#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:26,789 INFO L290 TraceCheckUtils]: 115: Hoare triple {104090#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:26,789 INFO L290 TraceCheckUtils]: 116: Hoare triple {104091#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:26,789 INFO L290 TraceCheckUtils]: 117: Hoare triple {104091#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:26,790 INFO L290 TraceCheckUtils]: 118: Hoare triple {104092#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:26,790 INFO L290 TraceCheckUtils]: 119: Hoare triple {104092#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:26,790 INFO L290 TraceCheckUtils]: 120: Hoare triple {104093#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:26,791 INFO L290 TraceCheckUtils]: 121: Hoare triple {104093#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:26,791 INFO L290 TraceCheckUtils]: 122: Hoare triple {104094#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:26,791 INFO L290 TraceCheckUtils]: 123: Hoare triple {104094#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:26,792 INFO L290 TraceCheckUtils]: 124: Hoare triple {104095#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:26,792 INFO L290 TraceCheckUtils]: 125: Hoare triple {104095#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:26,792 INFO L290 TraceCheckUtils]: 126: Hoare triple {104096#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:26,793 INFO L290 TraceCheckUtils]: 127: Hoare triple {104096#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:26,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {104097#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:26,793 INFO L290 TraceCheckUtils]: 129: Hoare triple {104097#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:26,793 INFO L290 TraceCheckUtils]: 130: Hoare triple {104098#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:26,794 INFO L290 TraceCheckUtils]: 131: Hoare triple {104098#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104099#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:26,794 INFO L290 TraceCheckUtils]: 132: Hoare triple {104099#(<= main_~i~0 63)} assume !(~i~0 < 1023); {104032#false} is VALID [2022-04-15 12:25:26,794 INFO L290 TraceCheckUtils]: 133: Hoare triple {104032#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {104032#false} is VALID [2022-04-15 12:25:26,794 INFO L290 TraceCheckUtils]: 134: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:26,794 INFO L290 TraceCheckUtils]: 135: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:26,794 INFO L290 TraceCheckUtils]: 136: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 137: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 138: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 139: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 140: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 141: Hoare triple {104032#false} assume !(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L272 TraceCheckUtils]: 142: Hoare triple {104032#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 143: Hoare triple {104032#false} ~cond := #in~cond; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 144: Hoare triple {104032#false} assume 0 == ~cond; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L290 TraceCheckUtils]: 145: Hoare triple {104032#false} assume !false; {104032#false} is VALID [2022-04-15 12:25:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:26,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:26,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198206563] [2022-04-15 12:25:26,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198206563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:26,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555286092] [2022-04-15 12:25:26,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:25:26,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:26,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:26,797 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-15 12:25:26,798 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-15 12:25:27,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:25:27,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:27,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 12:25:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:27,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:28,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {104031#true} call ULTIMATE.init(); {104031#true} is VALID [2022-04-15 12:25:28,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {104031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {104031#true} is VALID [2022-04-15 12:25:28,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 12:25:28,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 12:25:28,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {104031#true} call #t~ret5 := main(); {104031#true} is VALID [2022-04-15 12:25:28,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {104031#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104119#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:28,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {104119#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104119#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:28,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {104119#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:28,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {104037#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:28,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {104037#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:28,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {104038#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:28,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {104038#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:28,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {104039#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:28,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {104039#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:28,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {104040#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:28,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {104040#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:28,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {104041#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:28,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {104041#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:28,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {104042#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:28,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {104042#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:28,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {104043#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:28,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {104043#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:28,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {104044#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:28,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {104044#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:28,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {104045#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:28,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {104045#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:28,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {104046#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:28,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {104046#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:28,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {104047#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:28,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {104047#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:28,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {104048#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:28,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {104048#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:28,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {104049#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:28,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {104049#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:28,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {104050#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:28,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {104050#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:28,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {104051#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:28,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {104051#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:28,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {104052#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:28,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {104052#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:28,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {104053#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:28,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {104053#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:28,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {104054#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:28,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {104054#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:28,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {104055#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:28,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {104055#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:28,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {104056#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:28,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {104056#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:28,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {104057#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:28,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {104057#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:28,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {104058#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:28,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {104058#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:28,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {104059#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:28,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {104059#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:28,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {104060#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:28,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {104060#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:28,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {104061#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:28,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {104061#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:28,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {104062#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:28,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {104062#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:28,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {104063#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:28,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {104063#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:28,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {104064#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:28,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {104064#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:28,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {104065#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:28,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {104065#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:28,076 INFO L290 TraceCheckUtils]: 66: Hoare triple {104066#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:28,076 INFO L290 TraceCheckUtils]: 67: Hoare triple {104066#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:28,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {104067#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:28,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {104067#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:28,077 INFO L290 TraceCheckUtils]: 70: Hoare triple {104068#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:28,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {104068#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:28,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {104069#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:28,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {104069#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:28,078 INFO L290 TraceCheckUtils]: 74: Hoare triple {104070#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:28,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {104070#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:28,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {104071#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:28,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {104071#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:28,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {104072#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:28,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {104072#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:28,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {104073#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:28,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {104073#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:28,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {104074#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:28,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {104074#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:28,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {104075#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:28,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {104075#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:28,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {104076#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:28,083 INFO L290 TraceCheckUtils]: 87: Hoare triple {104076#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:28,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {104077#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:28,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {104077#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:28,084 INFO L290 TraceCheckUtils]: 90: Hoare triple {104078#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:28,084 INFO L290 TraceCheckUtils]: 91: Hoare triple {104078#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:28,084 INFO L290 TraceCheckUtils]: 92: Hoare triple {104079#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:28,085 INFO L290 TraceCheckUtils]: 93: Hoare triple {104079#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:28,085 INFO L290 TraceCheckUtils]: 94: Hoare triple {104080#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:28,085 INFO L290 TraceCheckUtils]: 95: Hoare triple {104080#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:28,085 INFO L290 TraceCheckUtils]: 96: Hoare triple {104081#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:28,086 INFO L290 TraceCheckUtils]: 97: Hoare triple {104081#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:28,086 INFO L290 TraceCheckUtils]: 98: Hoare triple {104082#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:28,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {104082#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:28,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {104083#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:28,087 INFO L290 TraceCheckUtils]: 101: Hoare triple {104083#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:28,087 INFO L290 TraceCheckUtils]: 102: Hoare triple {104084#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:28,088 INFO L290 TraceCheckUtils]: 103: Hoare triple {104084#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:28,088 INFO L290 TraceCheckUtils]: 104: Hoare triple {104085#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:28,088 INFO L290 TraceCheckUtils]: 105: Hoare triple {104085#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:28,089 INFO L290 TraceCheckUtils]: 106: Hoare triple {104086#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:28,089 INFO L290 TraceCheckUtils]: 107: Hoare triple {104086#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:28,089 INFO L290 TraceCheckUtils]: 108: Hoare triple {104087#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:28,090 INFO L290 TraceCheckUtils]: 109: Hoare triple {104087#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:28,090 INFO L290 TraceCheckUtils]: 110: Hoare triple {104088#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:28,090 INFO L290 TraceCheckUtils]: 111: Hoare triple {104088#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:28,090 INFO L290 TraceCheckUtils]: 112: Hoare triple {104089#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:28,091 INFO L290 TraceCheckUtils]: 113: Hoare triple {104089#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:28,091 INFO L290 TraceCheckUtils]: 114: Hoare triple {104090#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:28,092 INFO L290 TraceCheckUtils]: 115: Hoare triple {104090#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:28,092 INFO L290 TraceCheckUtils]: 116: Hoare triple {104091#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:28,092 INFO L290 TraceCheckUtils]: 117: Hoare triple {104091#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:28,092 INFO L290 TraceCheckUtils]: 118: Hoare triple {104092#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:28,093 INFO L290 TraceCheckUtils]: 119: Hoare triple {104092#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:28,093 INFO L290 TraceCheckUtils]: 120: Hoare triple {104093#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:28,093 INFO L290 TraceCheckUtils]: 121: Hoare triple {104093#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:28,094 INFO L290 TraceCheckUtils]: 122: Hoare triple {104094#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:28,094 INFO L290 TraceCheckUtils]: 123: Hoare triple {104094#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:28,094 INFO L290 TraceCheckUtils]: 124: Hoare triple {104095#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:28,095 INFO L290 TraceCheckUtils]: 125: Hoare triple {104095#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:28,095 INFO L290 TraceCheckUtils]: 126: Hoare triple {104096#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:28,095 INFO L290 TraceCheckUtils]: 127: Hoare triple {104096#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:28,096 INFO L290 TraceCheckUtils]: 128: Hoare triple {104097#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:28,096 INFO L290 TraceCheckUtils]: 129: Hoare triple {104097#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:28,096 INFO L290 TraceCheckUtils]: 130: Hoare triple {104098#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 131: Hoare triple {104098#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104099#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 132: Hoare triple {104099#(<= main_~i~0 63)} assume !(~i~0 < 1023); {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 133: Hoare triple {104032#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 134: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 135: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 136: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 137: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 138: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 139: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 12:25:28,097 INFO L290 TraceCheckUtils]: 140: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:28,098 INFO L290 TraceCheckUtils]: 141: Hoare triple {104032#false} assume !(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:28,098 INFO L272 TraceCheckUtils]: 142: Hoare triple {104032#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {104032#false} is VALID [2022-04-15 12:25:28,098 INFO L290 TraceCheckUtils]: 143: Hoare triple {104032#false} ~cond := #in~cond; {104032#false} is VALID [2022-04-15 12:25:28,098 INFO L290 TraceCheckUtils]: 144: Hoare triple {104032#false} assume 0 == ~cond; {104032#false} is VALID [2022-04-15 12:25:28,098 INFO L290 TraceCheckUtils]: 145: Hoare triple {104032#false} assume !false; {104032#false} is VALID [2022-04-15 12:25:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:28,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 145: Hoare triple {104032#false} assume !false; {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 144: Hoare triple {104032#false} assume 0 == ~cond; {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 143: Hoare triple {104032#false} ~cond := #in~cond; {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L272 TraceCheckUtils]: 142: Hoare triple {104032#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 141: Hoare triple {104032#false} assume !(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 140: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 139: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 138: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:32,459 INFO L290 TraceCheckUtils]: 137: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:32,460 INFO L290 TraceCheckUtils]: 136: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 12:25:32,460 INFO L290 TraceCheckUtils]: 135: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 12:25:32,460 INFO L290 TraceCheckUtils]: 134: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 12:25:32,460 INFO L290 TraceCheckUtils]: 133: Hoare triple {104032#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {104032#false} is VALID [2022-04-15 12:25:32,460 INFO L290 TraceCheckUtils]: 132: Hoare triple {104579#(< main_~i~0 1023)} assume !(~i~0 < 1023); {104032#false} is VALID [2022-04-15 12:25:32,460 INFO L290 TraceCheckUtils]: 131: Hoare triple {104583#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(< main_~i~0 1023)} is VALID [2022-04-15 12:25:32,461 INFO L290 TraceCheckUtils]: 130: Hoare triple {104583#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -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 1022)} is VALID [2022-04-15 12:25:32,461 INFO L290 TraceCheckUtils]: 129: Hoare triple {104590#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(< main_~i~0 1022)} is VALID [2022-04-15 12:25:32,461 INFO L290 TraceCheckUtils]: 128: Hoare triple {104590#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -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 1021)} is VALID [2022-04-15 12:25:32,462 INFO L290 TraceCheckUtils]: 127: Hoare triple {104597#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(< main_~i~0 1021)} is VALID [2022-04-15 12:25:32,462 INFO L290 TraceCheckUtils]: 126: Hoare triple {104597#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -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 1020)} is VALID [2022-04-15 12:25:32,462 INFO L290 TraceCheckUtils]: 125: Hoare triple {104604#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(< main_~i~0 1020)} is VALID [2022-04-15 12:25:32,463 INFO L290 TraceCheckUtils]: 124: Hoare triple {104604#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -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 1019)} is VALID [2022-04-15 12:25:32,463 INFO L290 TraceCheckUtils]: 123: Hoare triple {104611#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(< main_~i~0 1019)} is VALID [2022-04-15 12:25:32,463 INFO L290 TraceCheckUtils]: 122: Hoare triple {104611#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -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 1018)} is VALID [2022-04-15 12:25:32,464 INFO L290 TraceCheckUtils]: 121: Hoare triple {104618#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(< main_~i~0 1018)} is VALID [2022-04-15 12:25:32,464 INFO L290 TraceCheckUtils]: 120: Hoare triple {104618#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104618#(< main_~i~0 1017)} is VALID [2022-04-15 12:25:32,464 INFO L290 TraceCheckUtils]: 119: Hoare triple {104625#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104618#(< main_~i~0 1017)} is VALID [2022-04-15 12:25:32,465 INFO L290 TraceCheckUtils]: 118: Hoare triple {104625#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104625#(< main_~i~0 1016)} is VALID [2022-04-15 12:25:32,465 INFO L290 TraceCheckUtils]: 117: Hoare triple {104632#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104625#(< main_~i~0 1016)} is VALID [2022-04-15 12:25:32,465 INFO L290 TraceCheckUtils]: 116: Hoare triple {104632#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104632#(< main_~i~0 1015)} is VALID [2022-04-15 12:25:32,466 INFO L290 TraceCheckUtils]: 115: Hoare triple {104639#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104632#(< main_~i~0 1015)} is VALID [2022-04-15 12:25:32,466 INFO L290 TraceCheckUtils]: 114: Hoare triple {104639#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104639#(< main_~i~0 1014)} is VALID [2022-04-15 12:25:32,466 INFO L290 TraceCheckUtils]: 113: Hoare triple {104646#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104639#(< main_~i~0 1014)} is VALID [2022-04-15 12:25:32,466 INFO L290 TraceCheckUtils]: 112: Hoare triple {104646#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104646#(< main_~i~0 1013)} is VALID [2022-04-15 12:25:32,467 INFO L290 TraceCheckUtils]: 111: Hoare triple {104653#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104646#(< main_~i~0 1013)} is VALID [2022-04-15 12:25:32,467 INFO L290 TraceCheckUtils]: 110: Hoare triple {104653#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104653#(< main_~i~0 1012)} is VALID [2022-04-15 12:25:32,467 INFO L290 TraceCheckUtils]: 109: Hoare triple {104660#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104653#(< main_~i~0 1012)} is VALID [2022-04-15 12:25:32,468 INFO L290 TraceCheckUtils]: 108: Hoare triple {104660#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104660#(< main_~i~0 1011)} is VALID [2022-04-15 12:25:32,468 INFO L290 TraceCheckUtils]: 107: Hoare triple {104667#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104660#(< main_~i~0 1011)} is VALID [2022-04-15 12:25:32,468 INFO L290 TraceCheckUtils]: 106: Hoare triple {104667#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104667#(< main_~i~0 1010)} is VALID [2022-04-15 12:25:32,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {104674#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104667#(< main_~i~0 1010)} is VALID [2022-04-15 12:25:32,469 INFO L290 TraceCheckUtils]: 104: Hoare triple {104674#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104674#(< main_~i~0 1009)} is VALID [2022-04-15 12:25:32,469 INFO L290 TraceCheckUtils]: 103: Hoare triple {104681#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104674#(< main_~i~0 1009)} is VALID [2022-04-15 12:25:32,470 INFO L290 TraceCheckUtils]: 102: Hoare triple {104681#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104681#(< main_~i~0 1008)} is VALID [2022-04-15 12:25:32,470 INFO L290 TraceCheckUtils]: 101: Hoare triple {104688#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104681#(< main_~i~0 1008)} is VALID [2022-04-15 12:25:32,470 INFO L290 TraceCheckUtils]: 100: Hoare triple {104688#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104688#(< main_~i~0 1007)} is VALID [2022-04-15 12:25:32,471 INFO L290 TraceCheckUtils]: 99: Hoare triple {104695#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104688#(< main_~i~0 1007)} is VALID [2022-04-15 12:25:32,471 INFO L290 TraceCheckUtils]: 98: Hoare triple {104695#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104695#(< main_~i~0 1006)} is VALID [2022-04-15 12:25:32,471 INFO L290 TraceCheckUtils]: 97: Hoare triple {104702#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104695#(< main_~i~0 1006)} is VALID [2022-04-15 12:25:32,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {104702#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104702#(< main_~i~0 1005)} is VALID [2022-04-15 12:25:32,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {104709#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104702#(< main_~i~0 1005)} is VALID [2022-04-15 12:25:32,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {104709#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104709#(< main_~i~0 1004)} is VALID [2022-04-15 12:25:32,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {104716#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104709#(< main_~i~0 1004)} is VALID [2022-04-15 12:25:32,473 INFO L290 TraceCheckUtils]: 92: Hoare triple {104716#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104716#(< main_~i~0 1003)} is VALID [2022-04-15 12:25:32,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {104723#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104716#(< main_~i~0 1003)} is VALID [2022-04-15 12:25:32,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {104723#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104723#(< main_~i~0 1002)} is VALID [2022-04-15 12:25:32,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {104730#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104723#(< main_~i~0 1002)} is VALID [2022-04-15 12:25:32,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {104730#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104730#(< main_~i~0 1001)} is VALID [2022-04-15 12:25:32,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {104737#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104730#(< main_~i~0 1001)} is VALID [2022-04-15 12:25:32,475 INFO L290 TraceCheckUtils]: 86: Hoare triple {104737#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104737#(< main_~i~0 1000)} is VALID [2022-04-15 12:25:32,475 INFO L290 TraceCheckUtils]: 85: Hoare triple {104744#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104737#(< main_~i~0 1000)} is VALID [2022-04-15 12:25:32,475 INFO L290 TraceCheckUtils]: 84: Hoare triple {104744#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104744#(< main_~i~0 999)} is VALID [2022-04-15 12:25:32,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {104751#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104744#(< main_~i~0 999)} is VALID [2022-04-15 12:25:32,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {104751#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104751#(< main_~i~0 998)} is VALID [2022-04-15 12:25:32,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {104758#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104751#(< main_~i~0 998)} is VALID [2022-04-15 12:25:32,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {104758#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104758#(< main_~i~0 997)} is VALID [2022-04-15 12:25:32,477 INFO L290 TraceCheckUtils]: 79: Hoare triple {104765#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104758#(< main_~i~0 997)} is VALID [2022-04-15 12:25:32,478 INFO L290 TraceCheckUtils]: 78: Hoare triple {104765#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104765#(< main_~i~0 996)} is VALID [2022-04-15 12:25:32,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {104772#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104765#(< main_~i~0 996)} is VALID [2022-04-15 12:25:32,478 INFO L290 TraceCheckUtils]: 76: Hoare triple {104772#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104772#(< main_~i~0 995)} is VALID [2022-04-15 12:25:32,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {104779#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104772#(< main_~i~0 995)} is VALID [2022-04-15 12:25:32,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {104779#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104779#(< main_~i~0 994)} is VALID [2022-04-15 12:25:32,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {104786#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104779#(< main_~i~0 994)} is VALID [2022-04-15 12:25:32,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {104786#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104786#(< main_~i~0 993)} is VALID [2022-04-15 12:25:32,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {104793#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104786#(< main_~i~0 993)} is VALID [2022-04-15 12:25:32,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {104793#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104793#(< main_~i~0 992)} is VALID [2022-04-15 12:25:32,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {104800#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104793#(< main_~i~0 992)} is VALID [2022-04-15 12:25:32,481 INFO L290 TraceCheckUtils]: 68: Hoare triple {104800#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104800#(< main_~i~0 991)} is VALID [2022-04-15 12:25:32,481 INFO L290 TraceCheckUtils]: 67: Hoare triple {104807#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104800#(< main_~i~0 991)} is VALID [2022-04-15 12:25:32,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {104807#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104807#(< main_~i~0 990)} is VALID [2022-04-15 12:25:32,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {104814#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104807#(< main_~i~0 990)} is VALID [2022-04-15 12:25:32,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {104814#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104814#(< main_~i~0 989)} is VALID [2022-04-15 12:25:32,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {104821#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104814#(< main_~i~0 989)} is VALID [2022-04-15 12:25:32,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {104821#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104821#(< main_~i~0 988)} is VALID [2022-04-15 12:25:32,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {104828#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104821#(< main_~i~0 988)} is VALID [2022-04-15 12:25:32,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {104828#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104828#(< main_~i~0 987)} is VALID [2022-04-15 12:25:32,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {104835#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104828#(< main_~i~0 987)} is VALID [2022-04-15 12:25:32,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {104835#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104835#(< main_~i~0 986)} is VALID [2022-04-15 12:25:32,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {104842#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104835#(< main_~i~0 986)} is VALID [2022-04-15 12:25:32,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {104842#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104842#(< main_~i~0 985)} is VALID [2022-04-15 12:25:32,485 INFO L290 TraceCheckUtils]: 55: Hoare triple {104849#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104842#(< main_~i~0 985)} is VALID [2022-04-15 12:25:32,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {104849#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104849#(< main_~i~0 984)} is VALID [2022-04-15 12:25:32,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {104856#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104849#(< main_~i~0 984)} is VALID [2022-04-15 12:25:32,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {104856#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104856#(< main_~i~0 983)} is VALID [2022-04-15 12:25:32,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {104863#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104856#(< main_~i~0 983)} is VALID [2022-04-15 12:25:32,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {104863#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104863#(< main_~i~0 982)} is VALID [2022-04-15 12:25:32,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {104870#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104863#(< main_~i~0 982)} is VALID [2022-04-15 12:25:32,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {104870#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104870#(< main_~i~0 981)} is VALID [2022-04-15 12:25:32,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {104877#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104870#(< main_~i~0 981)} is VALID [2022-04-15 12:25:32,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {104877#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104877#(< main_~i~0 980)} is VALID [2022-04-15 12:25:32,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {104884#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104877#(< main_~i~0 980)} is VALID [2022-04-15 12:25:32,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {104884#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104884#(< main_~i~0 979)} is VALID [2022-04-15 12:25:32,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {104891#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104884#(< main_~i~0 979)} is VALID [2022-04-15 12:25:32,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {104891#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104891#(< main_~i~0 978)} is VALID [2022-04-15 12:25:32,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {104898#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104891#(< main_~i~0 978)} is VALID [2022-04-15 12:25:32,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {104898#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104898#(< main_~i~0 977)} is VALID [2022-04-15 12:25:32,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {104905#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104898#(< main_~i~0 977)} is VALID [2022-04-15 12:25:32,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {104905#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104905#(< main_~i~0 976)} is VALID [2022-04-15 12:25:32,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {104912#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104905#(< main_~i~0 976)} is VALID [2022-04-15 12:25:32,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {104912#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104912#(< main_~i~0 975)} is VALID [2022-04-15 12:25:32,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {104919#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104912#(< main_~i~0 975)} is VALID [2022-04-15 12:25:32,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {104919#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104919#(< main_~i~0 974)} is VALID [2022-04-15 12:25:32,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {104926#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104919#(< main_~i~0 974)} is VALID [2022-04-15 12:25:32,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {104926#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104926#(< main_~i~0 973)} is VALID [2022-04-15 12:25:32,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {104933#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104926#(< main_~i~0 973)} is VALID [2022-04-15 12:25:32,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {104933#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104933#(< main_~i~0 972)} is VALID [2022-04-15 12:25:32,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {104940#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104933#(< main_~i~0 972)} is VALID [2022-04-15 12:25:32,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {104940#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104940#(< main_~i~0 971)} is VALID [2022-04-15 12:25:32,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {104947#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104940#(< main_~i~0 971)} is VALID [2022-04-15 12:25:32,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {104947#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104947#(< main_~i~0 970)} is VALID [2022-04-15 12:25:32,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {104954#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104947#(< main_~i~0 970)} is VALID [2022-04-15 12:25:32,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {104954#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104954#(< main_~i~0 969)} is VALID [2022-04-15 12:25:32,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {104961#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104954#(< main_~i~0 969)} is VALID [2022-04-15 12:25:32,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {104961#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104961#(< main_~i~0 968)} is VALID [2022-04-15 12:25:32,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {104968#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104961#(< main_~i~0 968)} is VALID [2022-04-15 12:25:32,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {104968#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104968#(< main_~i~0 967)} is VALID [2022-04-15 12:25:32,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {104975#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104968#(< main_~i~0 967)} is VALID [2022-04-15 12:25:32,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {104975#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104975#(< main_~i~0 966)} is VALID [2022-04-15 12:25:32,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {104982#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104975#(< main_~i~0 966)} is VALID [2022-04-15 12:25:32,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {104982#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104982#(< main_~i~0 965)} is VALID [2022-04-15 12:25:32,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {104989#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104982#(< main_~i~0 965)} is VALID [2022-04-15 12:25:32,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {104989#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104989#(< main_~i~0 964)} is VALID [2022-04-15 12:25:32,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {104996#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104989#(< main_~i~0 964)} is VALID [2022-04-15 12:25:32,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {104996#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104996#(< main_~i~0 963)} is VALID [2022-04-15 12:25:32,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {105003#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104996#(< main_~i~0 963)} is VALID [2022-04-15 12:25:32,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {105003#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105003#(< main_~i~0 962)} is VALID [2022-04-15 12:25:32,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {105010#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105003#(< main_~i~0 962)} is VALID [2022-04-15 12:25:32,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {105010#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105010#(< main_~i~0 961)} is VALID [2022-04-15 12:25:32,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {105017#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105010#(< main_~i~0 961)} is VALID [2022-04-15 12:25:32,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {105017#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105017#(< main_~i~0 960)} is VALID [2022-04-15 12:25:32,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {104031#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {105017#(< main_~i~0 960)} is VALID [2022-04-15 12:25:32,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {104031#true} call #t~ret5 := main(); {104031#true} is VALID [2022-04-15 12:25:32,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 12:25:32,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 12:25:32,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {104031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {104031#true} is VALID [2022-04-15 12:25:32,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {104031#true} call ULTIMATE.init(); {104031#true} is VALID [2022-04-15 12:25:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555286092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:32,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:32,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 132 [2022-04-15 12:25:32,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:32,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59939435] [2022-04-15 12:25:32,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59939435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:32,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:32,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 12:25:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800389464] [2022-04-15 12:25:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 12:25:32,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:32,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:32,591 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-15 12:25:32,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 12:25:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:32,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 12:25:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8517, Invalid=8775, Unknown=0, NotChecked=0, Total=17292 [2022-04-15 12:25:32,594 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:47,752 INFO L93 Difference]: Finished difference Result 413 states and 477 transitions. [2022-04-15 12:25:47,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 12:25:47,752 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 12:25:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 472 transitions. [2022-04-15 12:25:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 472 transitions. [2022-04-15 12:25:47,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 472 transitions. [2022-04-15 12:25:48,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:48,098 INFO L225 Difference]: With dead ends: 413 [2022-04-15 12:25:48,098 INFO L226 Difference]: Without dead ends: 399 [2022-04-15 12:25:48,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=16902, Invalid=21318, Unknown=0, NotChecked=0, Total=38220 [2022-04-15 12:25:48,101 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1004 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:48,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 31 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:25:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-15 12:25:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 149. [2022-04-15 12:25:49,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:49,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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-15 12:25:49,167 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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-15 12:25:49,167 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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-15 12:25:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:49,172 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2022-04-15 12:25:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 462 transitions. [2022-04-15 12:25:49,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:49,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:49,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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 399 states. [2022-04-15 12:25:49,173 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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 399 states. [2022-04-15 12:25:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:49,178 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2022-04-15 12:25:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 462 transitions. [2022-04-15 12:25:49,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:49,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:49,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:49,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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-15 12:25:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-15 12:25:49,180 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2022-04-15 12:25:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:49,180 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-15 12:25:49,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:49,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-15 12:25:49,532 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-15 12:25:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-15 12:25:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-15 12:25:49,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:49,533 INFO L499 BasicCegarLoop]: trace histogram [64, 64, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:49,554 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-15 12:25:49,743 WARN L460 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-15 12:25:49,743 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1879179695, now seen corresponding path program 129 times [2022-04-15 12:25:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:49,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143404386] [2022-04-15 12:25:49,748 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:25:49,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:25:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1879179695, now seen corresponding path program 130 times [2022-04-15 12:25:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:49,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133340340] [2022-04-15 12:25:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:51,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {107161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {107091#true} is VALID [2022-04-15 12:25:51,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 12:25:51,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 12:25:51,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {107091#true} call ULTIMATE.init(); {107161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:51,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {107161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {107091#true} is VALID [2022-04-15 12:25:51,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 12:25:51,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 12:25:51,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {107091#true} call #t~ret5 := main(); {107091#true} is VALID [2022-04-15 12:25:51,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {107091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107096#(= main_~i~0 0)} is VALID [2022-04-15 12:25:51,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {107096#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107096#(= main_~i~0 0)} is VALID [2022-04-15 12:25:51,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {107096#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:51,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {107097#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:51,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {107097#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:51,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {107098#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:51,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {107098#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:51,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {107099#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:51,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {107099#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:51,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {107100#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:51,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {107100#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:51,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {107101#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:51,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {107101#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:51,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {107102#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:51,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {107102#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:51,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {107103#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:51,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {107103#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:51,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {107104#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:51,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {107104#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:51,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {107105#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:51,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {107105#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:51,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {107106#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:51,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {107106#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:51,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {107107#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:51,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {107107#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:51,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {107108#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:51,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {107108#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:51,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {107109#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:51,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {107109#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:51,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {107110#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:51,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {107110#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:51,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {107111#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:51,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {107111#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:51,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {107112#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:51,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {107112#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:51,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {107113#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:51,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {107113#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:51,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {107114#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:51,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {107114#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:51,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {107115#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:51,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {107115#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:51,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {107116#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:51,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {107116#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:51,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {107117#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:51,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {107117#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:51,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {107118#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:51,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {107118#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:51,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {107119#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:51,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {107119#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:51,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {107120#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:51,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {107120#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:51,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {107121#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:51,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {107121#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:51,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {107122#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:51,318 INFO L290 TraceCheckUtils]: 59: Hoare triple {107122#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:51,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {107123#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:51,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {107123#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:51,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {107124#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:51,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {107124#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:51,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {107125#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:51,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {107125#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:51,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {107126#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:51,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {107126#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:51,322 INFO L290 TraceCheckUtils]: 68: Hoare triple {107127#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:51,322 INFO L290 TraceCheckUtils]: 69: Hoare triple {107127#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:51,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {107128#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:51,323 INFO L290 TraceCheckUtils]: 71: Hoare triple {107128#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:51,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {107129#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:51,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {107129#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:51,324 INFO L290 TraceCheckUtils]: 74: Hoare triple {107130#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:51,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {107130#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:51,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {107131#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:51,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {107131#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:51,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {107132#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:51,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {107132#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:51,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {107133#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:51,327 INFO L290 TraceCheckUtils]: 81: Hoare triple {107133#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:51,328 INFO L290 TraceCheckUtils]: 82: Hoare triple {107134#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:51,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {107134#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:51,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {107135#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:51,329 INFO L290 TraceCheckUtils]: 85: Hoare triple {107135#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:51,329 INFO L290 TraceCheckUtils]: 86: Hoare triple {107136#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:51,329 INFO L290 TraceCheckUtils]: 87: Hoare triple {107136#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:51,330 INFO L290 TraceCheckUtils]: 88: Hoare triple {107137#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:51,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {107137#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:51,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {107138#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:51,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {107138#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:51,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {107139#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:51,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {107139#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:51,332 INFO L290 TraceCheckUtils]: 94: Hoare triple {107140#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:51,332 INFO L290 TraceCheckUtils]: 95: Hoare triple {107140#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:51,332 INFO L290 TraceCheckUtils]: 96: Hoare triple {107141#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:51,333 INFO L290 TraceCheckUtils]: 97: Hoare triple {107141#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:51,333 INFO L290 TraceCheckUtils]: 98: Hoare triple {107142#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:51,333 INFO L290 TraceCheckUtils]: 99: Hoare triple {107142#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:51,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {107143#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:51,334 INFO L290 TraceCheckUtils]: 101: Hoare triple {107143#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:51,334 INFO L290 TraceCheckUtils]: 102: Hoare triple {107144#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:51,335 INFO L290 TraceCheckUtils]: 103: Hoare triple {107144#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:51,335 INFO L290 TraceCheckUtils]: 104: Hoare triple {107145#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:51,335 INFO L290 TraceCheckUtils]: 105: Hoare triple {107145#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:51,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {107146#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:51,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {107146#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:51,336 INFO L290 TraceCheckUtils]: 108: Hoare triple {107147#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:51,337 INFO L290 TraceCheckUtils]: 109: Hoare triple {107147#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:51,337 INFO L290 TraceCheckUtils]: 110: Hoare triple {107148#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:51,337 INFO L290 TraceCheckUtils]: 111: Hoare triple {107148#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:51,337 INFO L290 TraceCheckUtils]: 112: Hoare triple {107149#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:51,338 INFO L290 TraceCheckUtils]: 113: Hoare triple {107149#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:51,338 INFO L290 TraceCheckUtils]: 114: Hoare triple {107150#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:51,338 INFO L290 TraceCheckUtils]: 115: Hoare triple {107150#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:51,339 INFO L290 TraceCheckUtils]: 116: Hoare triple {107151#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:51,339 INFO L290 TraceCheckUtils]: 117: Hoare triple {107151#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:51,339 INFO L290 TraceCheckUtils]: 118: Hoare triple {107152#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:51,340 INFO L290 TraceCheckUtils]: 119: Hoare triple {107152#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:51,340 INFO L290 TraceCheckUtils]: 120: Hoare triple {107153#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:51,340 INFO L290 TraceCheckUtils]: 121: Hoare triple {107153#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:51,341 INFO L290 TraceCheckUtils]: 122: Hoare triple {107154#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:51,341 INFO L290 TraceCheckUtils]: 123: Hoare triple {107154#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:51,341 INFO L290 TraceCheckUtils]: 124: Hoare triple {107155#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:51,342 INFO L290 TraceCheckUtils]: 125: Hoare triple {107155#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:51,342 INFO L290 TraceCheckUtils]: 126: Hoare triple {107156#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:51,342 INFO L290 TraceCheckUtils]: 127: Hoare triple {107156#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:51,343 INFO L290 TraceCheckUtils]: 128: Hoare triple {107157#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:51,343 INFO L290 TraceCheckUtils]: 129: Hoare triple {107157#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:51,343 INFO L290 TraceCheckUtils]: 130: Hoare triple {107158#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:51,344 INFO L290 TraceCheckUtils]: 131: Hoare triple {107158#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:51,344 INFO L290 TraceCheckUtils]: 132: Hoare triple {107159#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:51,344 INFO L290 TraceCheckUtils]: 133: Hoare triple {107159#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107160#(<= main_~i~0 64)} is VALID [2022-04-15 12:25:51,344 INFO L290 TraceCheckUtils]: 134: Hoare triple {107160#(<= main_~i~0 64)} assume !(~i~0 < 1023); {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 135: Hoare triple {107092#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 136: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 137: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 138: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 139: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 140: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 141: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 142: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 143: Hoare triple {107092#false} assume !(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L272 TraceCheckUtils]: 144: Hoare triple {107092#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 145: Hoare triple {107092#false} ~cond := #in~cond; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 146: Hoare triple {107092#false} assume 0 == ~cond; {107092#false} is VALID [2022-04-15 12:25:51,345 INFO L290 TraceCheckUtils]: 147: Hoare triple {107092#false} assume !false; {107092#false} is VALID [2022-04-15 12:25:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4103 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133340340] [2022-04-15 12:25:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133340340] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109071256] [2022-04-15 12:25:51,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:25:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:51,347 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-15 12:25:51,349 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-15 12:25:51,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:25:51,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:51,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 12:25:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:51,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:52,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {107091#true} call ULTIMATE.init(); {107091#true} is VALID [2022-04-15 12:25:52,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {107091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {107091#true} is VALID [2022-04-15 12:25:52,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 12:25:52,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 12:25:52,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {107091#true} call #t~ret5 := main(); {107091#true} is VALID [2022-04-15 12:25:52,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {107091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107180#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:52,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {107180#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107180#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:52,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {107180#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:52,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {107097#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:52,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {107097#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:52,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {107098#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:52,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {107098#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:52,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {107099#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:52,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {107099#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:52,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {107100#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:52,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {107100#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:52,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {107101#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:52,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {107101#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:52,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {107102#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:52,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {107102#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:52,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {107103#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:52,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {107103#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:52,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {107104#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:52,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {107104#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:52,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {107105#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:52,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {107105#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:52,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {107106#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:52,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {107106#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:52,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {107107#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:52,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {107107#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:52,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {107108#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:52,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {107108#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:52,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {107109#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:52,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {107109#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:52,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {107110#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:52,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {107110#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:52,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {107111#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:52,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {107111#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:52,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {107112#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:52,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {107112#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:52,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {107113#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:52,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {107113#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:52,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {107114#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:52,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {107114#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:52,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {107115#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:52,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {107115#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:52,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {107116#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:52,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {107116#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:52,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {107117#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:52,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {107117#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:52,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {107118#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:52,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {107118#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:52,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {107119#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:52,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {107119#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:52,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {107120#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:52,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {107120#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:52,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {107121#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:52,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {107121#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:52,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {107122#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:52,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {107122#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:52,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {107123#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:52,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {107123#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:52,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {107124#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:52,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {107124#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:52,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {107125#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:52,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {107125#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:52,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {107126#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:52,801 INFO L290 TraceCheckUtils]: 67: Hoare triple {107126#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:52,801 INFO L290 TraceCheckUtils]: 68: Hoare triple {107127#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:52,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {107127#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:52,802 INFO L290 TraceCheckUtils]: 70: Hoare triple {107128#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:52,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {107128#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:52,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {107129#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:52,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {107129#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:52,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {107130#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:52,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {107130#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:52,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {107131#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:52,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {107131#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:52,805 INFO L290 TraceCheckUtils]: 78: Hoare triple {107132#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:52,805 INFO L290 TraceCheckUtils]: 79: Hoare triple {107132#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:52,805 INFO L290 TraceCheckUtils]: 80: Hoare triple {107133#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:52,806 INFO L290 TraceCheckUtils]: 81: Hoare triple {107133#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:52,806 INFO L290 TraceCheckUtils]: 82: Hoare triple {107134#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:52,806 INFO L290 TraceCheckUtils]: 83: Hoare triple {107134#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:52,806 INFO L290 TraceCheckUtils]: 84: Hoare triple {107135#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:52,807 INFO L290 TraceCheckUtils]: 85: Hoare triple {107135#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:52,807 INFO L290 TraceCheckUtils]: 86: Hoare triple {107136#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:52,807 INFO L290 TraceCheckUtils]: 87: Hoare triple {107136#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:52,808 INFO L290 TraceCheckUtils]: 88: Hoare triple {107137#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:52,808 INFO L290 TraceCheckUtils]: 89: Hoare triple {107137#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:52,808 INFO L290 TraceCheckUtils]: 90: Hoare triple {107138#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:52,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {107138#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:52,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {107139#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:52,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {107139#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:52,810 INFO L290 TraceCheckUtils]: 94: Hoare triple {107140#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:52,810 INFO L290 TraceCheckUtils]: 95: Hoare triple {107140#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:52,810 INFO L290 TraceCheckUtils]: 96: Hoare triple {107141#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:52,811 INFO L290 TraceCheckUtils]: 97: Hoare triple {107141#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:52,811 INFO L290 TraceCheckUtils]: 98: Hoare triple {107142#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:52,811 INFO L290 TraceCheckUtils]: 99: Hoare triple {107142#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:52,812 INFO L290 TraceCheckUtils]: 100: Hoare triple {107143#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:52,812 INFO L290 TraceCheckUtils]: 101: Hoare triple {107143#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:52,812 INFO L290 TraceCheckUtils]: 102: Hoare triple {107144#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:52,813 INFO L290 TraceCheckUtils]: 103: Hoare triple {107144#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:52,813 INFO L290 TraceCheckUtils]: 104: Hoare triple {107145#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:52,813 INFO L290 TraceCheckUtils]: 105: Hoare triple {107145#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:52,814 INFO L290 TraceCheckUtils]: 106: Hoare triple {107146#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:52,814 INFO L290 TraceCheckUtils]: 107: Hoare triple {107146#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:52,814 INFO L290 TraceCheckUtils]: 108: Hoare triple {107147#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:52,815 INFO L290 TraceCheckUtils]: 109: Hoare triple {107147#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:52,815 INFO L290 TraceCheckUtils]: 110: Hoare triple {107148#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:52,815 INFO L290 TraceCheckUtils]: 111: Hoare triple {107148#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:52,815 INFO L290 TraceCheckUtils]: 112: Hoare triple {107149#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:52,816 INFO L290 TraceCheckUtils]: 113: Hoare triple {107149#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:52,816 INFO L290 TraceCheckUtils]: 114: Hoare triple {107150#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:52,816 INFO L290 TraceCheckUtils]: 115: Hoare triple {107150#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:52,817 INFO L290 TraceCheckUtils]: 116: Hoare triple {107151#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:52,817 INFO L290 TraceCheckUtils]: 117: Hoare triple {107151#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:52,817 INFO L290 TraceCheckUtils]: 118: Hoare triple {107152#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:52,818 INFO L290 TraceCheckUtils]: 119: Hoare triple {107152#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:52,818 INFO L290 TraceCheckUtils]: 120: Hoare triple {107153#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:52,818 INFO L290 TraceCheckUtils]: 121: Hoare triple {107153#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:52,819 INFO L290 TraceCheckUtils]: 122: Hoare triple {107154#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:52,819 INFO L290 TraceCheckUtils]: 123: Hoare triple {107154#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:52,819 INFO L290 TraceCheckUtils]: 124: Hoare triple {107155#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:52,820 INFO L290 TraceCheckUtils]: 125: Hoare triple {107155#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:52,820 INFO L290 TraceCheckUtils]: 126: Hoare triple {107156#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:52,820 INFO L290 TraceCheckUtils]: 127: Hoare triple {107156#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:52,821 INFO L290 TraceCheckUtils]: 128: Hoare triple {107157#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:52,821 INFO L290 TraceCheckUtils]: 129: Hoare triple {107157#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:52,821 INFO L290 TraceCheckUtils]: 130: Hoare triple {107158#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:52,822 INFO L290 TraceCheckUtils]: 131: Hoare triple {107158#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:52,822 INFO L290 TraceCheckUtils]: 132: Hoare triple {107159#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:52,822 INFO L290 TraceCheckUtils]: 133: Hoare triple {107159#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107160#(<= main_~i~0 64)} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 134: Hoare triple {107160#(<= main_~i~0 64)} assume !(~i~0 < 1023); {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 135: Hoare triple {107092#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 136: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 137: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 138: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 139: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 140: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 141: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 142: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 143: Hoare triple {107092#false} assume !(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L272 TraceCheckUtils]: 144: Hoare triple {107092#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 145: Hoare triple {107092#false} ~cond := #in~cond; {107092#false} is VALID [2022-04-15 12:25:52,823 INFO L290 TraceCheckUtils]: 146: Hoare triple {107092#false} assume 0 == ~cond; {107092#false} is VALID [2022-04-15 12:25:52,824 INFO L290 TraceCheckUtils]: 147: Hoare triple {107092#false} assume !false; {107092#false} is VALID [2022-04-15 12:25:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4103 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:52,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:57,448 INFO L290 TraceCheckUtils]: 147: Hoare triple {107092#false} assume !false; {107092#false} is VALID [2022-04-15 12:25:57,448 INFO L290 TraceCheckUtils]: 146: Hoare triple {107092#false} assume 0 == ~cond; {107092#false} is VALID [2022-04-15 12:25:57,448 INFO L290 TraceCheckUtils]: 145: Hoare triple {107092#false} ~cond := #in~cond; {107092#false} is VALID [2022-04-15 12:25:57,448 INFO L272 TraceCheckUtils]: 144: Hoare triple {107092#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 143: Hoare triple {107092#false} assume !(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 142: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 141: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 140: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 139: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 138: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 137: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 136: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 135: Hoare triple {107092#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {107092#false} is VALID [2022-04-15 12:25:57,449 INFO L290 TraceCheckUtils]: 134: Hoare triple {107646#(< main_~i~0 1023)} assume !(~i~0 < 1023); {107092#false} is VALID [2022-04-15 12:25:57,450 INFO L290 TraceCheckUtils]: 133: Hoare triple {107650#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107646#(< main_~i~0 1023)} is VALID [2022-04-15 12:25:57,450 INFO L290 TraceCheckUtils]: 132: Hoare triple {107650#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107650#(< main_~i~0 1022)} is VALID [2022-04-15 12:25:57,450 INFO L290 TraceCheckUtils]: 131: Hoare triple {107657#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107650#(< main_~i~0 1022)} is VALID [2022-04-15 12:25:57,451 INFO L290 TraceCheckUtils]: 130: Hoare triple {107657#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107657#(< main_~i~0 1021)} is VALID [2022-04-15 12:25:57,451 INFO L290 TraceCheckUtils]: 129: Hoare triple {107664#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107657#(< main_~i~0 1021)} is VALID [2022-04-15 12:25:57,451 INFO L290 TraceCheckUtils]: 128: Hoare triple {107664#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107664#(< main_~i~0 1020)} is VALID [2022-04-15 12:25:57,452 INFO L290 TraceCheckUtils]: 127: Hoare triple {107671#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107664#(< main_~i~0 1020)} is VALID [2022-04-15 12:25:57,452 INFO L290 TraceCheckUtils]: 126: Hoare triple {107671#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107671#(< main_~i~0 1019)} is VALID [2022-04-15 12:25:57,452 INFO L290 TraceCheckUtils]: 125: Hoare triple {107678#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107671#(< main_~i~0 1019)} is VALID [2022-04-15 12:25:57,453 INFO L290 TraceCheckUtils]: 124: Hoare triple {107678#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107678#(< main_~i~0 1018)} is VALID [2022-04-15 12:25:57,453 INFO L290 TraceCheckUtils]: 123: Hoare triple {107685#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107678#(< main_~i~0 1018)} is VALID [2022-04-15 12:25:57,453 INFO L290 TraceCheckUtils]: 122: Hoare triple {107685#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107685#(< main_~i~0 1017)} is VALID [2022-04-15 12:25:57,454 INFO L290 TraceCheckUtils]: 121: Hoare triple {107692#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107685#(< main_~i~0 1017)} is VALID [2022-04-15 12:25:57,454 INFO L290 TraceCheckUtils]: 120: Hoare triple {107692#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107692#(< main_~i~0 1016)} is VALID [2022-04-15 12:25:57,454 INFO L290 TraceCheckUtils]: 119: Hoare triple {107699#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107692#(< main_~i~0 1016)} is VALID [2022-04-15 12:25:57,454 INFO L290 TraceCheckUtils]: 118: Hoare triple {107699#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107699#(< main_~i~0 1015)} is VALID [2022-04-15 12:25:57,455 INFO L290 TraceCheckUtils]: 117: Hoare triple {107706#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107699#(< main_~i~0 1015)} is VALID [2022-04-15 12:25:57,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {107706#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107706#(< main_~i~0 1014)} is VALID [2022-04-15 12:25:57,456 INFO L290 TraceCheckUtils]: 115: Hoare triple {107713#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107706#(< main_~i~0 1014)} is VALID [2022-04-15 12:25:57,456 INFO L290 TraceCheckUtils]: 114: Hoare triple {107713#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107713#(< main_~i~0 1013)} is VALID [2022-04-15 12:25:57,456 INFO L290 TraceCheckUtils]: 113: Hoare triple {107720#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107713#(< main_~i~0 1013)} is VALID [2022-04-15 12:25:57,456 INFO L290 TraceCheckUtils]: 112: Hoare triple {107720#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107720#(< main_~i~0 1012)} is VALID [2022-04-15 12:25:57,457 INFO L290 TraceCheckUtils]: 111: Hoare triple {107727#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107720#(< main_~i~0 1012)} is VALID [2022-04-15 12:25:57,457 INFO L290 TraceCheckUtils]: 110: Hoare triple {107727#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107727#(< main_~i~0 1011)} is VALID [2022-04-15 12:25:57,457 INFO L290 TraceCheckUtils]: 109: Hoare triple {107734#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107727#(< main_~i~0 1011)} is VALID [2022-04-15 12:25:57,458 INFO L290 TraceCheckUtils]: 108: Hoare triple {107734#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107734#(< main_~i~0 1010)} is VALID [2022-04-15 12:25:57,458 INFO L290 TraceCheckUtils]: 107: Hoare triple {107741#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107734#(< main_~i~0 1010)} is VALID [2022-04-15 12:25:57,458 INFO L290 TraceCheckUtils]: 106: Hoare triple {107741#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107741#(< main_~i~0 1009)} is VALID [2022-04-15 12:25:57,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {107748#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107741#(< main_~i~0 1009)} is VALID [2022-04-15 12:25:57,459 INFO L290 TraceCheckUtils]: 104: Hoare triple {107748#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107748#(< main_~i~0 1008)} is VALID [2022-04-15 12:25:57,459 INFO L290 TraceCheckUtils]: 103: Hoare triple {107755#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107748#(< main_~i~0 1008)} is VALID [2022-04-15 12:25:57,460 INFO L290 TraceCheckUtils]: 102: Hoare triple {107755#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107755#(< main_~i~0 1007)} is VALID [2022-04-15 12:25:57,460 INFO L290 TraceCheckUtils]: 101: Hoare triple {107762#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107755#(< main_~i~0 1007)} is VALID [2022-04-15 12:25:57,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {107762#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -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 1006)} is VALID [2022-04-15 12:25:57,461 INFO L290 TraceCheckUtils]: 99: Hoare triple {107769#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(< main_~i~0 1006)} is VALID [2022-04-15 12:25:57,461 INFO L290 TraceCheckUtils]: 98: Hoare triple {107769#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -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 1005)} is VALID [2022-04-15 12:25:57,461 INFO L290 TraceCheckUtils]: 97: Hoare triple {107776#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(< main_~i~0 1005)} is VALID [2022-04-15 12:25:57,462 INFO L290 TraceCheckUtils]: 96: Hoare triple {107776#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -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 1004)} is VALID [2022-04-15 12:25:57,462 INFO L290 TraceCheckUtils]: 95: Hoare triple {107783#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(< main_~i~0 1004)} is VALID [2022-04-15 12:25:57,462 INFO L290 TraceCheckUtils]: 94: Hoare triple {107783#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -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 1003)} is VALID [2022-04-15 12:25:57,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {107790#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(< main_~i~0 1003)} is VALID [2022-04-15 12:25:57,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {107790#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -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 1002)} is VALID [2022-04-15 12:25:57,463 INFO L290 TraceCheckUtils]: 91: Hoare triple {107797#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(< main_~i~0 1002)} is VALID [2022-04-15 12:25:57,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {107797#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -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 1001)} is VALID [2022-04-15 12:25:57,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {107804#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(< main_~i~0 1001)} is VALID [2022-04-15 12:25:57,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {107804#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -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 1000)} is VALID [2022-04-15 12:25:57,465 INFO L290 TraceCheckUtils]: 87: Hoare triple {107811#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(< main_~i~0 1000)} is VALID [2022-04-15 12:25:57,465 INFO L290 TraceCheckUtils]: 86: Hoare triple {107811#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -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 999)} is VALID [2022-04-15 12:25:57,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {107818#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(< main_~i~0 999)} is VALID [2022-04-15 12:25:57,466 INFO L290 TraceCheckUtils]: 84: Hoare triple {107818#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -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 998)} is VALID [2022-04-15 12:25:57,466 INFO L290 TraceCheckUtils]: 83: Hoare triple {107825#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(< main_~i~0 998)} is VALID [2022-04-15 12:25:57,466 INFO L290 TraceCheckUtils]: 82: Hoare triple {107825#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107825#(< main_~i~0 997)} is VALID [2022-04-15 12:25:57,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {107832#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107825#(< main_~i~0 997)} is VALID [2022-04-15 12:25:57,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {107832#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107832#(< main_~i~0 996)} is VALID [2022-04-15 12:25:57,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {107839#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107832#(< main_~i~0 996)} is VALID [2022-04-15 12:25:57,468 INFO L290 TraceCheckUtils]: 78: Hoare triple {107839#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107839#(< main_~i~0 995)} is VALID [2022-04-15 12:25:57,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {107846#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107839#(< main_~i~0 995)} is VALID [2022-04-15 12:25:57,468 INFO L290 TraceCheckUtils]: 76: Hoare triple {107846#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107846#(< main_~i~0 994)} is VALID [2022-04-15 12:25:57,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {107853#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107846#(< main_~i~0 994)} is VALID [2022-04-15 12:25:57,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {107853#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107853#(< main_~i~0 993)} is VALID [2022-04-15 12:25:57,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {107860#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107853#(< main_~i~0 993)} is VALID [2022-04-15 12:25:57,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {107860#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107860#(< main_~i~0 992)} is VALID [2022-04-15 12:25:57,470 INFO L290 TraceCheckUtils]: 71: Hoare triple {107867#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107860#(< main_~i~0 992)} is VALID [2022-04-15 12:25:57,470 INFO L290 TraceCheckUtils]: 70: Hoare triple {107867#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107867#(< main_~i~0 991)} is VALID [2022-04-15 12:25:57,470 INFO L290 TraceCheckUtils]: 69: Hoare triple {107874#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107867#(< main_~i~0 991)} is VALID [2022-04-15 12:25:57,471 INFO L290 TraceCheckUtils]: 68: Hoare triple {107874#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107874#(< main_~i~0 990)} is VALID [2022-04-15 12:25:57,471 INFO L290 TraceCheckUtils]: 67: Hoare triple {107881#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107874#(< main_~i~0 990)} is VALID [2022-04-15 12:25:57,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {107881#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107881#(< main_~i~0 989)} is VALID [2022-04-15 12:25:57,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {107888#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107881#(< main_~i~0 989)} is VALID [2022-04-15 12:25:57,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {107888#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107888#(< main_~i~0 988)} is VALID [2022-04-15 12:25:57,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {107895#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107888#(< main_~i~0 988)} is VALID [2022-04-15 12:25:57,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {107895#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107895#(< main_~i~0 987)} is VALID [2022-04-15 12:25:57,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {107902#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107895#(< main_~i~0 987)} is VALID [2022-04-15 12:25:57,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {107902#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107902#(< main_~i~0 986)} is VALID [2022-04-15 12:25:57,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {107909#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107902#(< main_~i~0 986)} is VALID [2022-04-15 12:25:57,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {107909#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107909#(< main_~i~0 985)} is VALID [2022-04-15 12:25:57,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {107916#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107909#(< main_~i~0 985)} is VALID [2022-04-15 12:25:57,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {107916#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107916#(< main_~i~0 984)} is VALID [2022-04-15 12:25:57,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {107923#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107916#(< main_~i~0 984)} is VALID [2022-04-15 12:25:57,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {107923#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107923#(< main_~i~0 983)} is VALID [2022-04-15 12:25:57,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {107930#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107923#(< main_~i~0 983)} is VALID [2022-04-15 12:25:57,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {107930#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107930#(< main_~i~0 982)} is VALID [2022-04-15 12:25:57,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {107937#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107930#(< main_~i~0 982)} is VALID [2022-04-15 12:25:57,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {107937#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107937#(< main_~i~0 981)} is VALID [2022-04-15 12:25:57,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {107944#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107937#(< main_~i~0 981)} is VALID [2022-04-15 12:25:57,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {107944#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107944#(< main_~i~0 980)} is VALID [2022-04-15 12:25:57,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {107951#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107944#(< main_~i~0 980)} is VALID [2022-04-15 12:25:57,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {107951#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107951#(< main_~i~0 979)} is VALID [2022-04-15 12:25:57,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {107958#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107951#(< main_~i~0 979)} is VALID [2022-04-15 12:25:57,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {107958#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107958#(< main_~i~0 978)} is VALID [2022-04-15 12:25:57,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {107965#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107958#(< main_~i~0 978)} is VALID [2022-04-15 12:25:57,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {107965#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107965#(< main_~i~0 977)} is VALID [2022-04-15 12:25:57,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {107972#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107965#(< main_~i~0 977)} is VALID [2022-04-15 12:25:57,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {107972#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107972#(< main_~i~0 976)} is VALID [2022-04-15 12:25:57,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {107979#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107972#(< main_~i~0 976)} is VALID [2022-04-15 12:25:57,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {107979#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107979#(< main_~i~0 975)} is VALID [2022-04-15 12:25:57,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {107986#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107979#(< main_~i~0 975)} is VALID [2022-04-15 12:25:57,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {107986#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107986#(< main_~i~0 974)} is VALID [2022-04-15 12:25:57,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {107993#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107986#(< main_~i~0 974)} is VALID [2022-04-15 12:25:57,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {107993#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107993#(< main_~i~0 973)} is VALID [2022-04-15 12:25:57,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {108000#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107993#(< main_~i~0 973)} is VALID [2022-04-15 12:25:57,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {108000#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108000#(< main_~i~0 972)} is VALID [2022-04-15 12:25:57,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {108007#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108000#(< main_~i~0 972)} is VALID [2022-04-15 12:25:57,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {108007#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108007#(< main_~i~0 971)} is VALID [2022-04-15 12:25:57,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {108014#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108007#(< main_~i~0 971)} is VALID [2022-04-15 12:25:57,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {108014#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108014#(< main_~i~0 970)} is VALID [2022-04-15 12:25:57,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {108021#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108014#(< main_~i~0 970)} is VALID [2022-04-15 12:25:57,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {108021#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108021#(< main_~i~0 969)} is VALID [2022-04-15 12:25:57,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {108028#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108021#(< main_~i~0 969)} is VALID [2022-04-15 12:25:57,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {108028#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108028#(< main_~i~0 968)} is VALID [2022-04-15 12:25:57,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {108035#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108028#(< main_~i~0 968)} is VALID [2022-04-15 12:25:57,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {108035#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108035#(< main_~i~0 967)} is VALID [2022-04-15 12:25:57,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {108042#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108035#(< main_~i~0 967)} is VALID [2022-04-15 12:25:57,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {108042#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108042#(< main_~i~0 966)} is VALID [2022-04-15 12:25:57,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {108049#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108042#(< main_~i~0 966)} is VALID [2022-04-15 12:25:57,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {108049#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108049#(< main_~i~0 965)} is VALID [2022-04-15 12:25:57,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {108056#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108049#(< main_~i~0 965)} is VALID [2022-04-15 12:25:57,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {108056#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108056#(< main_~i~0 964)} is VALID [2022-04-15 12:25:57,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {108063#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108056#(< main_~i~0 964)} is VALID [2022-04-15 12:25:57,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {108063#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108063#(< main_~i~0 963)} is VALID [2022-04-15 12:25:57,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {108070#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108063#(< main_~i~0 963)} is VALID [2022-04-15 12:25:57,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {108070#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108070#(< main_~i~0 962)} is VALID [2022-04-15 12:25:57,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {108077#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108070#(< main_~i~0 962)} is VALID [2022-04-15 12:25:57,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {108077#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108077#(< main_~i~0 961)} is VALID [2022-04-15 12:25:57,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {108084#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108077#(< main_~i~0 961)} is VALID [2022-04-15 12:25:57,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {108084#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108084#(< main_~i~0 960)} is VALID [2022-04-15 12:25:57,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {108091#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108084#(< main_~i~0 960)} is VALID [2022-04-15 12:25:57,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {108091#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108091#(< main_~i~0 959)} is VALID [2022-04-15 12:25:57,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {107091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {108091#(< main_~i~0 959)} is VALID [2022-04-15 12:25:57,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {107091#true} call #t~ret5 := main(); {107091#true} is VALID [2022-04-15 12:25:57,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 12:25:57,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 12:25:57,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {107091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {107091#true} is VALID [2022-04-15 12:25:57,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {107091#true} call ULTIMATE.init(); {107091#true} is VALID [2022-04-15 12:25:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4103 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:25:57,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109071256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:57,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:57,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-15 12:25:57,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:57,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143404386] [2022-04-15 12:25:57,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143404386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:57,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:57,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 12:25:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291672621] [2022-04-15 12:25:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:57,493 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 12:25:57,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:57,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:57,595 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-15 12:25:57,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 12:25:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 12:25:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=9042, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 12:25:57,598 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:13,118 INFO L93 Difference]: Finished difference Result 419 states and 484 transitions. [2022-04-15 12:26:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 12:26:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 12:26:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:26:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 479 transitions. [2022-04-15 12:26:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 479 transitions. [2022-04-15 12:26:13,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 479 transitions. [2022-04-15 12:26:13,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:13,464 INFO L225 Difference]: With dead ends: 419 [2022-04-15 12:26:13,464 INFO L226 Difference]: Without dead ends: 405 [2022-04-15 12:26:13,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=17426, Invalid=21976, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 12:26:13,466 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1084 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:26:13,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1084 Valid, 31 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:26:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-15 12:26:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 151. [2022-04-15 12:26:14,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:26:14,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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-15 12:26:14,588 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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-15 12:26:14,588 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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-15 12:26:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:14,594 INFO L93 Difference]: Finished difference Result 405 states and 469 transitions. [2022-04-15 12:26:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 469 transitions. [2022-04-15 12:26:14,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:14,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:14,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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 405 states. [2022-04-15 12:26:14,594 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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 405 states. [2022-04-15 12:26:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:14,600 INFO L93 Difference]: Finished difference Result 405 states and 469 transitions. [2022-04-15 12:26:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 469 transitions. [2022-04-15 12:26:14,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:14,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:14,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:26:14,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:26:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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-15 12:26:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-04-15 12:26:14,602 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2022-04-15 12:26:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:26:14,602 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-04-15 12:26:14,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:14,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 152 transitions. [2022-04-15 12:26:14,956 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-15 12:26:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-04-15 12:26:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 12:26:14,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:26:14,957 INFO L499 BasicCegarLoop]: trace histogram [65, 65, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:26:14,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-15 12:26:15,157 WARN L460 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-15 12:26:15,158 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:26:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:26:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 243077329, now seen corresponding path program 131 times [2022-04-15 12:26:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:15,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [426706111] [2022-04-15 12:26:15,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:26:15,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:26:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 243077329, now seen corresponding path program 132 times [2022-04-15 12:26:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873274174] [2022-04-15 12:26:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:26:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:16,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {110266#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {110195#true} is VALID [2022-04-15 12:26:16,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 12:26:16,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 12:26:16,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {110195#true} call ULTIMATE.init(); {110266#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:26:16,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {110266#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {110195#true} is VALID [2022-04-15 12:26:16,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 12:26:16,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 12:26:16,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {110195#true} call #t~ret5 := main(); {110195#true} is VALID [2022-04-15 12:26:16,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {110195#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {110200#(= main_~i~0 0)} is VALID [2022-04-15 12:26:16,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {110200#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110200#(= main_~i~0 0)} is VALID [2022-04-15 12:26:16,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {110200#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:16,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {110201#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:16,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {110201#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:16,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {110202#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:16,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {110202#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110203#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:16,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {110203#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110203#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:16,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {110203#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110204#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:16,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {110204#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110204#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:16,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {110204#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110205#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:16,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {110205#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110205#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:16,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {110205#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110206#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:16,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {110206#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110206#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:16,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {110206#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110207#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:16,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {110207#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110207#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:16,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {110207#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110208#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:16,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {110208#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110208#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:16,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {110208#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110209#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:16,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {110209#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110209#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:16,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {110209#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110210#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:16,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {110210#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110210#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:16,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {110210#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110211#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:16,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {110211#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110211#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:16,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {110211#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110212#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:16,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {110212#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110212#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:16,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {110212#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110213#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:16,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {110213#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110213#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:16,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {110213#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110214#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:16,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {110214#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110214#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:16,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {110214#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110215#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:16,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {110215#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110215#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:16,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {110215#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110216#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:16,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {110216#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110216#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:16,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {110216#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110217#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:16,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {110217#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110217#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:16,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {110217#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110218#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:16,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {110218#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110218#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:16,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {110218#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110219#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:16,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {110219#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110219#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:16,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {110219#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110220#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:16,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {110220#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110220#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:16,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {110220#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110221#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:16,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {110221#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110221#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:16,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {110221#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110222#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:16,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {110222#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110222#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:16,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {110222#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110223#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:16,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {110223#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110223#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:16,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {110223#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110224#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:16,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {110224#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110224#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:16,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {110224#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110225#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:16,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {110225#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110225#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:16,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {110225#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110226#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:16,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {110226#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110226#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:16,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {110226#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110227#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:16,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {110227#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110227#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:16,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {110227#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110228#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:16,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {110228#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110228#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:16,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {110228#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110229#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:16,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {110229#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110229#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:16,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {110229#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110230#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:16,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {110230#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110230#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:16,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {110230#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110231#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:16,747 INFO L290 TraceCheckUtils]: 68: Hoare triple {110231#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110231#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:16,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {110231#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110232#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:16,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {110232#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110232#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:16,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {110232#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110233#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:16,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {110233#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110233#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:16,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {110233#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110234#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:16,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {110234#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110234#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:16,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {110234#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110235#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:16,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {110235#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110235#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:16,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {110235#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110236#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:16,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {110236#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110236#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:16,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {110236#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110237#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:16,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {110237#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110237#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:16,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {110237#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110238#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:16,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {110238#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110238#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:16,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {110238#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110239#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:16,752 INFO L290 TraceCheckUtils]: 84: Hoare triple {110239#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110239#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:16,752 INFO L290 TraceCheckUtils]: 85: Hoare triple {110239#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110240#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:16,753 INFO L290 TraceCheckUtils]: 86: Hoare triple {110240#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110240#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:16,753 INFO L290 TraceCheckUtils]: 87: Hoare triple {110240#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110241#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:16,753 INFO L290 TraceCheckUtils]: 88: Hoare triple {110241#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110241#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:16,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {110241#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110242#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:16,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {110242#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110242#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:16,754 INFO L290 TraceCheckUtils]: 91: Hoare triple {110242#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110243#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:16,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {110243#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110243#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:16,755 INFO L290 TraceCheckUtils]: 93: Hoare triple {110243#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110244#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:16,755 INFO L290 TraceCheckUtils]: 94: Hoare triple {110244#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110244#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:16,756 INFO L290 TraceCheckUtils]: 95: Hoare triple {110244#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110245#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:16,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {110245#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110245#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:16,756 INFO L290 TraceCheckUtils]: 97: Hoare triple {110245#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110246#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:16,757 INFO L290 TraceCheckUtils]: 98: Hoare triple {110246#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110246#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:16,757 INFO L290 TraceCheckUtils]: 99: Hoare triple {110246#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110247#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:16,757 INFO L290 TraceCheckUtils]: 100: Hoare triple {110247#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110247#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:16,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {110247#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110248#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:16,758 INFO L290 TraceCheckUtils]: 102: Hoare triple {110248#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110248#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:16,758 INFO L290 TraceCheckUtils]: 103: Hoare triple {110248#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110249#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:16,759 INFO L290 TraceCheckUtils]: 104: Hoare triple {110249#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110249#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:16,759 INFO L290 TraceCheckUtils]: 105: Hoare triple {110249#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110250#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:16,759 INFO L290 TraceCheckUtils]: 106: Hoare triple {110250#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110250#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:16,760 INFO L290 TraceCheckUtils]: 107: Hoare triple {110250#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110251#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:16,760 INFO L290 TraceCheckUtils]: 108: Hoare triple {110251#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110251#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:16,760 INFO L290 TraceCheckUtils]: 109: Hoare triple {110251#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110252#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:16,760 INFO L290 TraceCheckUtils]: 110: Hoare triple {110252#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110252#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:16,761 INFO L290 TraceCheckUtils]: 111: Hoare triple {110252#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110253#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:16,761 INFO L290 TraceCheckUtils]: 112: Hoare triple {110253#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110253#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:16,761 INFO L290 TraceCheckUtils]: 113: Hoare triple {110253#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110254#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:16,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {110254#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110254#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:16,762 INFO L290 TraceCheckUtils]: 115: Hoare triple {110254#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110255#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:16,762 INFO L290 TraceCheckUtils]: 116: Hoare triple {110255#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110255#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:16,763 INFO L290 TraceCheckUtils]: 117: Hoare triple {110255#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110256#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:16,763 INFO L290 TraceCheckUtils]: 118: Hoare triple {110256#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110256#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:16,763 INFO L290 TraceCheckUtils]: 119: Hoare triple {110256#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110257#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:16,764 INFO L290 TraceCheckUtils]: 120: Hoare triple {110257#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110257#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:16,764 INFO L290 TraceCheckUtils]: 121: Hoare triple {110257#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110258#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:16,764 INFO L290 TraceCheckUtils]: 122: Hoare triple {110258#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110258#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:16,765 INFO L290 TraceCheckUtils]: 123: Hoare triple {110258#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110259#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:16,765 INFO L290 TraceCheckUtils]: 124: Hoare triple {110259#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110259#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:16,765 INFO L290 TraceCheckUtils]: 125: Hoare triple {110259#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110260#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:16,766 INFO L290 TraceCheckUtils]: 126: Hoare triple {110260#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110260#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:16,766 INFO L290 TraceCheckUtils]: 127: Hoare triple {110260#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110261#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:16,766 INFO L290 TraceCheckUtils]: 128: Hoare triple {110261#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110261#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:16,767 INFO L290 TraceCheckUtils]: 129: Hoare triple {110261#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110262#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:16,767 INFO L290 TraceCheckUtils]: 130: Hoare triple {110262#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110262#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:16,767 INFO L290 TraceCheckUtils]: 131: Hoare triple {110262#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110263#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:16,768 INFO L290 TraceCheckUtils]: 132: Hoare triple {110263#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110263#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:16,768 INFO L290 TraceCheckUtils]: 133: Hoare triple {110263#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110264#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:16,768 INFO L290 TraceCheckUtils]: 134: Hoare triple {110264#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110264#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 135: Hoare triple {110264#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110265#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 136: Hoare triple {110265#(<= main_~i~0 65)} assume !(~i~0 < 1023); {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 137: Hoare triple {110196#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 138: Hoare triple {110196#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 139: Hoare triple {110196#false} assume !!(0 != #t~mem4);havoc #t~mem4; {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 140: Hoare triple {110196#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 141: Hoare triple {110196#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 142: Hoare triple {110196#false} assume !!(0 != #t~mem4);havoc #t~mem4; {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 143: Hoare triple {110196#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 144: Hoare triple {110196#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110196#false} is VALID [2022-04-15 12:26:16,769 INFO L290 TraceCheckUtils]: 145: Hoare triple {110196#false} assume !(0 != #t~mem4);havoc #t~mem4; {110196#false} is VALID [2022-04-15 12:26:16,770 INFO L272 TraceCheckUtils]: 146: Hoare triple {110196#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {110196#false} is VALID [2022-04-15 12:26:16,770 INFO L290 TraceCheckUtils]: 147: Hoare triple {110196#false} ~cond := #in~cond; {110196#false} is VALID [2022-04-15 12:26:16,770 INFO L290 TraceCheckUtils]: 148: Hoare triple {110196#false} assume 0 == ~cond; {110196#false} is VALID [2022-04-15 12:26:16,770 INFO L290 TraceCheckUtils]: 149: Hoare triple {110196#false} assume !false; {110196#false} is VALID [2022-04-15 12:26:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:26:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:26:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873274174] [2022-04-15 12:26:16,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873274174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:26:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228871856] [2022-04-15 12:26:16,771 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:26:16,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:26:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:26:16,772 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-15 12:26:16,772 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-15 12:26:17,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:26:17,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:26:17,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:26:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:17,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:26:17,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {110195#true} call ULTIMATE.init(); {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {110195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {110195#true} call #t~ret5 := main(); {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {110195#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 54: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 71: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 79: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 81: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 84: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 87: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,666 INFO L290 TraceCheckUtils]: 88: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 89: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 90: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 91: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 92: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 93: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 94: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 95: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 96: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 97: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 98: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,667 INFO L290 TraceCheckUtils]: 99: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 100: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 102: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 103: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 104: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 105: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 106: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 107: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 108: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 109: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,668 INFO L290 TraceCheckUtils]: 110: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 111: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 112: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 113: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 114: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 115: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 116: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 117: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 118: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 119: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 120: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,669 INFO L290 TraceCheckUtils]: 121: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 122: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 123: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 124: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 125: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 126: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 127: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 128: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 129: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 130: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 131: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 132: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,670 INFO L290 TraceCheckUtils]: 133: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,671 INFO L290 TraceCheckUtils]: 134: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:17,671 INFO L290 TraceCheckUtils]: 135: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:17,671 INFO L290 TraceCheckUtils]: 136: Hoare triple {110195#true} assume !(~i~0 < 1023); {110195#true} is VALID [2022-04-15 12:26:17,671 INFO L290 TraceCheckUtils]: 137: Hoare triple {110195#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {110681#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:17,672 INFO L290 TraceCheckUtils]: 138: Hoare triple {110681#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110681#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:17,672 INFO L290 TraceCheckUtils]: 139: Hoare triple {110681#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {110681#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:17,673 INFO L290 TraceCheckUtils]: 140: Hoare triple {110681#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:17,673 INFO L290 TraceCheckUtils]: 141: Hoare triple {110201#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110201#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:17,673 INFO L290 TraceCheckUtils]: 142: Hoare triple {110201#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:17,674 INFO L290 TraceCheckUtils]: 143: Hoare triple {110201#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:17,674 INFO L290 TraceCheckUtils]: 144: Hoare triple {110202#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110202#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:17,675 INFO L290 TraceCheckUtils]: 145: Hoare triple {110202#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:17,675 INFO L272 TraceCheckUtils]: 146: Hoare triple {110202#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:26:17,676 INFO L290 TraceCheckUtils]: 147: Hoare triple {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:26:17,676 INFO L290 TraceCheckUtils]: 148: Hoare triple {110713#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {110196#false} is VALID [2022-04-15 12:26:17,676 INFO L290 TraceCheckUtils]: 149: Hoare triple {110196#false} assume !false; {110196#false} is VALID [2022-04-15 12:26:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 12:26:17,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:26:18,093 INFO L290 TraceCheckUtils]: 149: Hoare triple {110196#false} assume !false; {110196#false} is VALID [2022-04-15 12:26:18,094 INFO L290 TraceCheckUtils]: 148: Hoare triple {110713#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {110196#false} is VALID [2022-04-15 12:26:18,094 INFO L290 TraceCheckUtils]: 147: Hoare triple {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:26:18,095 INFO L272 TraceCheckUtils]: 146: Hoare triple {110729#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:26:18,095 INFO L290 TraceCheckUtils]: 145: Hoare triple {110729#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {110729#(<= main_~i~0 1024)} is VALID [2022-04-15 12:26:18,095 INFO L290 TraceCheckUtils]: 144: Hoare triple {110729#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110729#(<= main_~i~0 1024)} is VALID [2022-04-15 12:26:18,096 INFO L290 TraceCheckUtils]: 143: Hoare triple {110739#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110729#(<= main_~i~0 1024)} is VALID [2022-04-15 12:26:18,096 INFO L290 TraceCheckUtils]: 142: Hoare triple {110739#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {110739#(<= main_~i~0 1023)} is VALID [2022-04-15 12:26:18,096 INFO L290 TraceCheckUtils]: 141: Hoare triple {110739#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110739#(<= main_~i~0 1023)} is VALID [2022-04-15 12:26:18,096 INFO L290 TraceCheckUtils]: 140: Hoare triple {110749#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110739#(<= main_~i~0 1023)} is VALID [2022-04-15 12:26:18,097 INFO L290 TraceCheckUtils]: 139: Hoare triple {110749#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {110749#(<= main_~i~0 1022)} is VALID [2022-04-15 12:26:18,097 INFO L290 TraceCheckUtils]: 138: Hoare triple {110749#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110749#(<= main_~i~0 1022)} is VALID [2022-04-15 12:26:18,097 INFO L290 TraceCheckUtils]: 137: Hoare triple {110195#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {110749#(<= main_~i~0 1022)} is VALID [2022-04-15 12:26:18,097 INFO L290 TraceCheckUtils]: 136: Hoare triple {110195#true} assume !(~i~0 < 1023); {110195#true} is VALID [2022-04-15 12:26:18,097 INFO L290 TraceCheckUtils]: 135: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 134: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 133: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 132: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 131: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 130: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 129: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 128: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 127: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 126: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 125: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 124: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 123: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 122: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,098 INFO L290 TraceCheckUtils]: 121: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 120: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 119: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 118: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 117: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 116: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 115: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 114: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 113: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 112: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 111: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 110: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 109: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 108: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 107: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,099 INFO L290 TraceCheckUtils]: 106: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 95: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 94: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 93: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 92: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,100 INFO L290 TraceCheckUtils]: 91: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 90: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 88: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 87: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 85: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 83: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 82: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,101 INFO L290 TraceCheckUtils]: 75: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 74: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 73: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 71: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {110195#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {110195#true} call #t~ret5 := main(); {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {110195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {110195#true} is VALID [2022-04-15 12:26:18,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {110195#true} call ULTIMATE.init(); {110195#true} is VALID [2022-04-15 12:26:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 12:26:18,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228871856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:26:18,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:26:18,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 7, 7] total 75 [2022-04-15 12:26:18,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:26:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [426706111] [2022-04-15 12:26:18,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [426706111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:18,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:18,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 12:26:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558853905] [2022-04-15 12:26:18,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:26:18,108 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-15 12:26:18,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:26:18,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:18,200 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-15 12:26:18,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 12:26:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:18,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 12:26:18,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2562, Invalid=2988, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:26:18,201 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:34,013 INFO L93 Difference]: Finished difference Result 425 states and 491 transitions. [2022-04-15 12:26:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 12:26:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-15 12:26:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:26:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 486 transitions. [2022-04-15 12:26:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 486 transitions. [2022-04-15 12:26:34,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 486 transitions. [2022-04-15 12:26:34,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:34,364 INFO L225 Difference]: With dead ends: 425 [2022-04-15 12:26:34,364 INFO L226 Difference]: Without dead ends: 411 [2022-04-15 12:26:34,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7315, Invalid=12425, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 12:26:34,365 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 985 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:26:34,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 51 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:26:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-15 12:26:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 153. [2022-04-15 12:26:35,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:26:35,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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-15 12:26:35,523 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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-15 12:26:35,523 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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-15 12:26:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:35,529 INFO L93 Difference]: Finished difference Result 411 states and 476 transitions. [2022-04-15 12:26:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 476 transitions. [2022-04-15 12:26:35,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:35,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:35,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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 411 states. [2022-04-15 12:26:35,529 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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 411 states. [2022-04-15 12:26:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:35,535 INFO L93 Difference]: Finished difference Result 411 states and 476 transitions. [2022-04-15 12:26:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 476 transitions. [2022-04-15 12:26:35,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:35,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:35,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:26:35,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:26:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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-15 12:26:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2022-04-15 12:26:35,537 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2022-04-15 12:26:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:26:35,537 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2022-04-15 12:26:35,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:35,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 154 transitions. [2022-04-15 12:26:35,907 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-15 12:26:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2022-04-15 12:26:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-15 12:26:35,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:26:35,907 INFO L499 BasicCegarLoop]: trace histogram [66, 66, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:26:35,925 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-15 12:26:36,108 WARN L460 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-15 12:26:36,108 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:26:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:26:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -93266061, now seen corresponding path program 133 times [2022-04-15 12:26:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:36,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670654261] [2022-04-15 12:26:36,115 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:26:36,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:26:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash -93266061, now seen corresponding path program 134 times [2022-04-15 12:26:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:36,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819099362] [2022-04-15 12:26:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:36,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:26:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:37,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {113354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {113282#true} is VALID [2022-04-15 12:26:37,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 12:26:37,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 12:26:37,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {113282#true} call ULTIMATE.init(); {113354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:26:37,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {113354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {113282#true} is VALID [2022-04-15 12:26:37,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 12:26:37,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 12:26:37,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {113282#true} call #t~ret5 := main(); {113282#true} is VALID [2022-04-15 12:26:37,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {113282#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {113287#(= main_~i~0 0)} is VALID [2022-04-15 12:26:37,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {113287#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113287#(= main_~i~0 0)} is VALID [2022-04-15 12:26:37,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {113287#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:37,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {113288#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:37,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {113288#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:37,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {113289#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:37,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {113289#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:37,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {113290#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:37,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {113290#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:37,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {113291#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:37,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {113291#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:37,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {113292#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:37,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {113292#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:37,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {113293#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:37,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {113293#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:37,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {113294#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:37,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {113294#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:37,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {113295#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:37,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {113295#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:37,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {113296#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:37,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {113296#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:37,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {113297#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:37,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {113297#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:37,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {113298#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:37,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {113298#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:37,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {113299#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:37,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {113299#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:37,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {113300#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:37,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {113300#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:37,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {113301#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:37,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {113301#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:37,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {113302#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:37,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {113302#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:37,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {113303#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:37,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {113303#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:37,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {113304#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:37,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {113304#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:37,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {113305#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:37,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {113305#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:37,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {113306#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:37,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {113306#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:37,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {113307#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:37,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {113307#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:37,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {113308#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:37,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {113308#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:37,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {113309#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:37,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {113309#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:37,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {113310#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:37,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {113310#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:37,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {113311#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:37,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {113311#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:37,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {113312#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:37,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {113312#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:37,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {113313#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:37,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {113313#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:37,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {113314#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:37,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {113314#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:37,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {113315#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:37,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {113315#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:37,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {113316#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:37,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {113316#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:37,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {113317#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:37,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {113317#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:37,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {113318#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:37,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {113318#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:37,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {113319#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:37,727 INFO L290 TraceCheckUtils]: 71: Hoare triple {113319#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:37,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {113320#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:37,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {113320#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:37,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {113321#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:37,728 INFO L290 TraceCheckUtils]: 75: Hoare triple {113321#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:37,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {113322#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:37,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {113322#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:37,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {113323#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:37,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {113323#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:37,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {113324#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:37,730 INFO L290 TraceCheckUtils]: 81: Hoare triple {113324#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:37,730 INFO L290 TraceCheckUtils]: 82: Hoare triple {113325#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:37,730 INFO L290 TraceCheckUtils]: 83: Hoare triple {113325#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:37,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {113326#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:37,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {113326#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:37,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {113327#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:37,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {113327#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:37,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {113328#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:37,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {113328#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:37,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {113329#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:37,733 INFO L290 TraceCheckUtils]: 91: Hoare triple {113329#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:37,733 INFO L290 TraceCheckUtils]: 92: Hoare triple {113330#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:37,733 INFO L290 TraceCheckUtils]: 93: Hoare triple {113330#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:37,734 INFO L290 TraceCheckUtils]: 94: Hoare triple {113331#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:37,734 INFO L290 TraceCheckUtils]: 95: Hoare triple {113331#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:37,734 INFO L290 TraceCheckUtils]: 96: Hoare triple {113332#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:37,735 INFO L290 TraceCheckUtils]: 97: Hoare triple {113332#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:37,735 INFO L290 TraceCheckUtils]: 98: Hoare triple {113333#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:37,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {113333#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:37,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {113334#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:37,736 INFO L290 TraceCheckUtils]: 101: Hoare triple {113334#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:37,736 INFO L290 TraceCheckUtils]: 102: Hoare triple {113335#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:37,737 INFO L290 TraceCheckUtils]: 103: Hoare triple {113335#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:37,737 INFO L290 TraceCheckUtils]: 104: Hoare triple {113336#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:37,737 INFO L290 TraceCheckUtils]: 105: Hoare triple {113336#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:37,738 INFO L290 TraceCheckUtils]: 106: Hoare triple {113337#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:37,738 INFO L290 TraceCheckUtils]: 107: Hoare triple {113337#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:37,738 INFO L290 TraceCheckUtils]: 108: Hoare triple {113338#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:37,739 INFO L290 TraceCheckUtils]: 109: Hoare triple {113338#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:37,739 INFO L290 TraceCheckUtils]: 110: Hoare triple {113339#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:37,739 INFO L290 TraceCheckUtils]: 111: Hoare triple {113339#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:37,739 INFO L290 TraceCheckUtils]: 112: Hoare triple {113340#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:37,740 INFO L290 TraceCheckUtils]: 113: Hoare triple {113340#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:37,740 INFO L290 TraceCheckUtils]: 114: Hoare triple {113341#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:37,740 INFO L290 TraceCheckUtils]: 115: Hoare triple {113341#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:37,741 INFO L290 TraceCheckUtils]: 116: Hoare triple {113342#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:37,741 INFO L290 TraceCheckUtils]: 117: Hoare triple {113342#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:37,741 INFO L290 TraceCheckUtils]: 118: Hoare triple {113343#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:37,742 INFO L290 TraceCheckUtils]: 119: Hoare triple {113343#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:37,742 INFO L290 TraceCheckUtils]: 120: Hoare triple {113344#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:37,742 INFO L290 TraceCheckUtils]: 121: Hoare triple {113344#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:37,743 INFO L290 TraceCheckUtils]: 122: Hoare triple {113345#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:37,743 INFO L290 TraceCheckUtils]: 123: Hoare triple {113345#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:37,743 INFO L290 TraceCheckUtils]: 124: Hoare triple {113346#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:37,744 INFO L290 TraceCheckUtils]: 125: Hoare triple {113346#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:37,744 INFO L290 TraceCheckUtils]: 126: Hoare triple {113347#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:37,744 INFO L290 TraceCheckUtils]: 127: Hoare triple {113347#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:37,744 INFO L290 TraceCheckUtils]: 128: Hoare triple {113348#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:37,745 INFO L290 TraceCheckUtils]: 129: Hoare triple {113348#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:37,745 INFO L290 TraceCheckUtils]: 130: Hoare triple {113349#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:37,745 INFO L290 TraceCheckUtils]: 131: Hoare triple {113349#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:37,746 INFO L290 TraceCheckUtils]: 132: Hoare triple {113350#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:37,746 INFO L290 TraceCheckUtils]: 133: Hoare triple {113350#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:37,746 INFO L290 TraceCheckUtils]: 134: Hoare triple {113351#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:37,747 INFO L290 TraceCheckUtils]: 135: Hoare triple {113351#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:37,747 INFO L290 TraceCheckUtils]: 136: Hoare triple {113352#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:37,747 INFO L290 TraceCheckUtils]: 137: Hoare triple {113352#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113353#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 138: Hoare triple {113353#(<= main_~i~0 66)} assume !(~i~0 < 1023); {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 139: Hoare triple {113283#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 140: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 141: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 142: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 143: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 144: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 145: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 146: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 147: Hoare triple {113283#false} assume !(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L272 TraceCheckUtils]: 148: Hoare triple {113283#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 149: Hoare triple {113283#false} ~cond := #in~cond; {113283#false} is VALID [2022-04-15 12:26:37,748 INFO L290 TraceCheckUtils]: 150: Hoare triple {113283#false} assume 0 == ~cond; {113283#false} is VALID [2022-04-15 12:26:37,749 INFO L290 TraceCheckUtils]: 151: Hoare triple {113283#false} assume !false; {113283#false} is VALID [2022-04-15 12:26:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4363 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:26:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:26:37,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819099362] [2022-04-15 12:26:37,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819099362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:26:37,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606569188] [2022-04-15 12:26:37,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:26:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:26:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:26:37,750 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-15 12:26:37,751 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-15 12:26:38,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:26:38,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:26:38,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 12:26:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:38,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:26:39,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {113282#true} call ULTIMATE.init(); {113282#true} is VALID [2022-04-15 12:26:39,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {113282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {113282#true} is VALID [2022-04-15 12:26:39,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 12:26:39,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 12:26:39,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {113282#true} call #t~ret5 := main(); {113282#true} is VALID [2022-04-15 12:26:39,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {113282#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {113373#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:39,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {113373#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113373#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:39,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {113373#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:39,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {113288#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:39,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {113288#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:39,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {113289#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:39,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {113289#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:39,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {113290#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:39,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {113290#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:39,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {113291#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:39,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {113291#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:39,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {113292#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:39,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {113292#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:39,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {113293#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:39,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {113293#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:39,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {113294#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:39,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {113294#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:39,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {113295#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:39,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {113295#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:39,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {113296#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:39,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {113296#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:39,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {113297#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:39,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {113297#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:39,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {113298#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:39,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {113298#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:39,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {113299#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:39,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {113299#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:39,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {113300#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:39,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {113300#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:39,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {113301#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:39,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {113301#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:39,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {113302#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:39,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {113302#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:39,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {113303#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:39,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {113303#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:39,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {113304#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:39,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {113304#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:39,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {113305#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:39,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {113305#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:39,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {113306#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:39,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {113306#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:39,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {113307#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:39,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {113307#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:39,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {113308#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:39,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {113308#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:39,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {113309#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:39,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {113309#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:39,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {113310#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:39,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {113310#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:39,084 INFO L290 TraceCheckUtils]: 54: Hoare triple {113311#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:39,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {113311#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:39,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {113312#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:39,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {113312#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:39,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {113313#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:39,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {113313#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:39,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {113314#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:39,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {113314#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:39,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {113315#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:39,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {113315#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:39,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {113316#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:39,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {113316#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:39,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {113317#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:39,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {113317#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:39,089 INFO L290 TraceCheckUtils]: 68: Hoare triple {113318#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:39,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {113318#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:39,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {113319#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:39,090 INFO L290 TraceCheckUtils]: 71: Hoare triple {113319#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:39,090 INFO L290 TraceCheckUtils]: 72: Hoare triple {113320#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:39,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {113320#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:39,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {113321#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:39,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {113321#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:39,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {113322#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:39,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {113322#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:39,092 INFO L290 TraceCheckUtils]: 78: Hoare triple {113323#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:39,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {113323#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:39,093 INFO L290 TraceCheckUtils]: 80: Hoare triple {113324#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:39,093 INFO L290 TraceCheckUtils]: 81: Hoare triple {113324#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:39,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {113325#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:39,094 INFO L290 TraceCheckUtils]: 83: Hoare triple {113325#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:39,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {113326#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:39,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {113326#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:39,094 INFO L290 TraceCheckUtils]: 86: Hoare triple {113327#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:39,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {113327#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:39,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {113328#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:39,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {113328#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:39,111 INFO L290 TraceCheckUtils]: 90: Hoare triple {113329#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:39,111 INFO L290 TraceCheckUtils]: 91: Hoare triple {113329#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:39,111 INFO L290 TraceCheckUtils]: 92: Hoare triple {113330#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:39,112 INFO L290 TraceCheckUtils]: 93: Hoare triple {113330#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:39,112 INFO L290 TraceCheckUtils]: 94: Hoare triple {113331#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:39,112 INFO L290 TraceCheckUtils]: 95: Hoare triple {113331#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:39,113 INFO L290 TraceCheckUtils]: 96: Hoare triple {113332#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:39,113 INFO L290 TraceCheckUtils]: 97: Hoare triple {113332#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:39,113 INFO L290 TraceCheckUtils]: 98: Hoare triple {113333#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:39,114 INFO L290 TraceCheckUtils]: 99: Hoare triple {113333#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:39,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {113334#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:39,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {113334#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:39,115 INFO L290 TraceCheckUtils]: 102: Hoare triple {113335#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:39,115 INFO L290 TraceCheckUtils]: 103: Hoare triple {113335#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:39,115 INFO L290 TraceCheckUtils]: 104: Hoare triple {113336#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:39,116 INFO L290 TraceCheckUtils]: 105: Hoare triple {113336#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:39,116 INFO L290 TraceCheckUtils]: 106: Hoare triple {113337#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:39,116 INFO L290 TraceCheckUtils]: 107: Hoare triple {113337#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:39,117 INFO L290 TraceCheckUtils]: 108: Hoare triple {113338#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:39,117 INFO L290 TraceCheckUtils]: 109: Hoare triple {113338#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:39,117 INFO L290 TraceCheckUtils]: 110: Hoare triple {113339#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:39,118 INFO L290 TraceCheckUtils]: 111: Hoare triple {113339#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:39,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {113340#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:39,118 INFO L290 TraceCheckUtils]: 113: Hoare triple {113340#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:39,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {113341#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:39,119 INFO L290 TraceCheckUtils]: 115: Hoare triple {113341#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:39,119 INFO L290 TraceCheckUtils]: 116: Hoare triple {113342#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:39,119 INFO L290 TraceCheckUtils]: 117: Hoare triple {113342#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:39,120 INFO L290 TraceCheckUtils]: 118: Hoare triple {113343#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:39,120 INFO L290 TraceCheckUtils]: 119: Hoare triple {113343#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:39,120 INFO L290 TraceCheckUtils]: 120: Hoare triple {113344#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:39,121 INFO L290 TraceCheckUtils]: 121: Hoare triple {113344#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:39,121 INFO L290 TraceCheckUtils]: 122: Hoare triple {113345#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:39,121 INFO L290 TraceCheckUtils]: 123: Hoare triple {113345#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:39,122 INFO L290 TraceCheckUtils]: 124: Hoare triple {113346#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:39,122 INFO L290 TraceCheckUtils]: 125: Hoare triple {113346#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:39,122 INFO L290 TraceCheckUtils]: 126: Hoare triple {113347#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:39,123 INFO L290 TraceCheckUtils]: 127: Hoare triple {113347#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:39,123 INFO L290 TraceCheckUtils]: 128: Hoare triple {113348#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:39,123 INFO L290 TraceCheckUtils]: 129: Hoare triple {113348#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:39,124 INFO L290 TraceCheckUtils]: 130: Hoare triple {113349#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:39,124 INFO L290 TraceCheckUtils]: 131: Hoare triple {113349#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:39,124 INFO L290 TraceCheckUtils]: 132: Hoare triple {113350#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:39,125 INFO L290 TraceCheckUtils]: 133: Hoare triple {113350#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:39,125 INFO L290 TraceCheckUtils]: 134: Hoare triple {113351#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:39,125 INFO L290 TraceCheckUtils]: 135: Hoare triple {113351#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:39,125 INFO L290 TraceCheckUtils]: 136: Hoare triple {113352#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:39,126 INFO L290 TraceCheckUtils]: 137: Hoare triple {113352#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113353#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:39,126 INFO L290 TraceCheckUtils]: 138: Hoare triple {113353#(<= main_~i~0 66)} assume !(~i~0 < 1023); {113283#false} is VALID [2022-04-15 12:26:39,126 INFO L290 TraceCheckUtils]: 139: Hoare triple {113283#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {113283#false} is VALID [2022-04-15 12:26:39,126 INFO L290 TraceCheckUtils]: 140: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:39,126 INFO L290 TraceCheckUtils]: 141: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:39,126 INFO L290 TraceCheckUtils]: 142: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 143: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 144: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 145: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 146: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 147: Hoare triple {113283#false} assume !(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L272 TraceCheckUtils]: 148: Hoare triple {113283#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 149: Hoare triple {113283#false} ~cond := #in~cond; {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 150: Hoare triple {113283#false} assume 0 == ~cond; {113283#false} is VALID [2022-04-15 12:26:39,127 INFO L290 TraceCheckUtils]: 151: Hoare triple {113283#false} assume !false; {113283#false} is VALID [2022-04-15 12:26:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4363 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:26:39,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:26:43,931 INFO L290 TraceCheckUtils]: 151: Hoare triple {113283#false} assume !false; {113283#false} is VALID [2022-04-15 12:26:43,931 INFO L290 TraceCheckUtils]: 150: Hoare triple {113283#false} assume 0 == ~cond; {113283#false} is VALID [2022-04-15 12:26:43,931 INFO L290 TraceCheckUtils]: 149: Hoare triple {113283#false} ~cond := #in~cond; {113283#false} is VALID [2022-04-15 12:26:43,931 INFO L272 TraceCheckUtils]: 148: Hoare triple {113283#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {113283#false} is VALID [2022-04-15 12:26:43,931 INFO L290 TraceCheckUtils]: 147: Hoare triple {113283#false} assume !(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 146: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 145: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 144: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 143: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 142: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 140: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 139: Hoare triple {113283#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {113283#false} is VALID [2022-04-15 12:26:43,932 INFO L290 TraceCheckUtils]: 138: Hoare triple {113851#(< main_~i~0 1023)} assume !(~i~0 < 1023); {113283#false} is VALID [2022-04-15 12:26:43,933 INFO L290 TraceCheckUtils]: 137: Hoare triple {113855#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113851#(< main_~i~0 1023)} is VALID [2022-04-15 12:26:43,933 INFO L290 TraceCheckUtils]: 136: Hoare triple {113855#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113855#(< main_~i~0 1022)} is VALID [2022-04-15 12:26:43,933 INFO L290 TraceCheckUtils]: 135: Hoare triple {113862#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113855#(< main_~i~0 1022)} is VALID [2022-04-15 12:26:43,934 INFO L290 TraceCheckUtils]: 134: Hoare triple {113862#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113862#(< main_~i~0 1021)} is VALID [2022-04-15 12:26:43,934 INFO L290 TraceCheckUtils]: 133: Hoare triple {113869#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113862#(< main_~i~0 1021)} is VALID [2022-04-15 12:26:43,934 INFO L290 TraceCheckUtils]: 132: Hoare triple {113869#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113869#(< main_~i~0 1020)} is VALID [2022-04-15 12:26:43,935 INFO L290 TraceCheckUtils]: 131: Hoare triple {113876#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113869#(< main_~i~0 1020)} is VALID [2022-04-15 12:26:43,935 INFO L290 TraceCheckUtils]: 130: Hoare triple {113876#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113876#(< main_~i~0 1019)} is VALID [2022-04-15 12:26:43,935 INFO L290 TraceCheckUtils]: 129: Hoare triple {113883#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113876#(< main_~i~0 1019)} is VALID [2022-04-15 12:26:43,935 INFO L290 TraceCheckUtils]: 128: Hoare triple {113883#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113883#(< main_~i~0 1018)} is VALID [2022-04-15 12:26:43,936 INFO L290 TraceCheckUtils]: 127: Hoare triple {113890#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113883#(< main_~i~0 1018)} is VALID [2022-04-15 12:26:43,936 INFO L290 TraceCheckUtils]: 126: Hoare triple {113890#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113890#(< main_~i~0 1017)} is VALID [2022-04-15 12:26:43,936 INFO L290 TraceCheckUtils]: 125: Hoare triple {113897#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113890#(< main_~i~0 1017)} is VALID [2022-04-15 12:26:43,937 INFO L290 TraceCheckUtils]: 124: Hoare triple {113897#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113897#(< main_~i~0 1016)} is VALID [2022-04-15 12:26:43,937 INFO L290 TraceCheckUtils]: 123: Hoare triple {113904#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113897#(< main_~i~0 1016)} is VALID [2022-04-15 12:26:43,937 INFO L290 TraceCheckUtils]: 122: Hoare triple {113904#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113904#(< main_~i~0 1015)} is VALID [2022-04-15 12:26:43,938 INFO L290 TraceCheckUtils]: 121: Hoare triple {113911#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113904#(< main_~i~0 1015)} is VALID [2022-04-15 12:26:43,938 INFO L290 TraceCheckUtils]: 120: Hoare triple {113911#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113911#(< main_~i~0 1014)} is VALID [2022-04-15 12:26:43,938 INFO L290 TraceCheckUtils]: 119: Hoare triple {113918#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113911#(< main_~i~0 1014)} is VALID [2022-04-15 12:26:43,939 INFO L290 TraceCheckUtils]: 118: Hoare triple {113918#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113918#(< main_~i~0 1013)} is VALID [2022-04-15 12:26:43,939 INFO L290 TraceCheckUtils]: 117: Hoare triple {113925#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113918#(< main_~i~0 1013)} is VALID [2022-04-15 12:26:43,939 INFO L290 TraceCheckUtils]: 116: Hoare triple {113925#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113925#(< main_~i~0 1012)} is VALID [2022-04-15 12:26:43,940 INFO L290 TraceCheckUtils]: 115: Hoare triple {113932#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113925#(< main_~i~0 1012)} is VALID [2022-04-15 12:26:43,940 INFO L290 TraceCheckUtils]: 114: Hoare triple {113932#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113932#(< main_~i~0 1011)} is VALID [2022-04-15 12:26:43,940 INFO L290 TraceCheckUtils]: 113: Hoare triple {113939#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113932#(< main_~i~0 1011)} is VALID [2022-04-15 12:26:43,941 INFO L290 TraceCheckUtils]: 112: Hoare triple {113939#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113939#(< main_~i~0 1010)} is VALID [2022-04-15 12:26:43,941 INFO L290 TraceCheckUtils]: 111: Hoare triple {113946#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113939#(< main_~i~0 1010)} is VALID [2022-04-15 12:26:43,941 INFO L290 TraceCheckUtils]: 110: Hoare triple {113946#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113946#(< main_~i~0 1009)} is VALID [2022-04-15 12:26:43,942 INFO L290 TraceCheckUtils]: 109: Hoare triple {113953#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113946#(< main_~i~0 1009)} is VALID [2022-04-15 12:26:43,942 INFO L290 TraceCheckUtils]: 108: Hoare triple {113953#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113953#(< main_~i~0 1008)} is VALID [2022-04-15 12:26:43,942 INFO L290 TraceCheckUtils]: 107: Hoare triple {113960#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113953#(< main_~i~0 1008)} is VALID [2022-04-15 12:26:43,942 INFO L290 TraceCheckUtils]: 106: Hoare triple {113960#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113960#(< main_~i~0 1007)} is VALID [2022-04-15 12:26:43,943 INFO L290 TraceCheckUtils]: 105: Hoare triple {113967#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113960#(< main_~i~0 1007)} is VALID [2022-04-15 12:26:43,943 INFO L290 TraceCheckUtils]: 104: Hoare triple {113967#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113967#(< main_~i~0 1006)} is VALID [2022-04-15 12:26:43,943 INFO L290 TraceCheckUtils]: 103: Hoare triple {113974#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113967#(< main_~i~0 1006)} is VALID [2022-04-15 12:26:43,944 INFO L290 TraceCheckUtils]: 102: Hoare triple {113974#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113974#(< main_~i~0 1005)} is VALID [2022-04-15 12:26:43,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {113981#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113974#(< main_~i~0 1005)} is VALID [2022-04-15 12:26:43,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {113981#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113981#(< main_~i~0 1004)} is VALID [2022-04-15 12:26:43,945 INFO L290 TraceCheckUtils]: 99: Hoare triple {113988#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113981#(< main_~i~0 1004)} is VALID [2022-04-15 12:26:43,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {113988#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113988#(< main_~i~0 1003)} is VALID [2022-04-15 12:26:43,945 INFO L290 TraceCheckUtils]: 97: Hoare triple {113995#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113988#(< main_~i~0 1003)} is VALID [2022-04-15 12:26:43,946 INFO L290 TraceCheckUtils]: 96: Hoare triple {113995#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113995#(< main_~i~0 1002)} is VALID [2022-04-15 12:26:43,946 INFO L290 TraceCheckUtils]: 95: Hoare triple {114002#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113995#(< main_~i~0 1002)} is VALID [2022-04-15 12:26:43,946 INFO L290 TraceCheckUtils]: 94: Hoare triple {114002#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114002#(< main_~i~0 1001)} is VALID [2022-04-15 12:26:43,947 INFO L290 TraceCheckUtils]: 93: Hoare triple {114009#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114002#(< main_~i~0 1001)} is VALID [2022-04-15 12:26:43,947 INFO L290 TraceCheckUtils]: 92: Hoare triple {114009#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114009#(< main_~i~0 1000)} is VALID [2022-04-15 12:26:43,947 INFO L290 TraceCheckUtils]: 91: Hoare triple {114016#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114009#(< main_~i~0 1000)} is VALID [2022-04-15 12:26:43,948 INFO L290 TraceCheckUtils]: 90: Hoare triple {114016#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114016#(< main_~i~0 999)} is VALID [2022-04-15 12:26:43,948 INFO L290 TraceCheckUtils]: 89: Hoare triple {114023#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114016#(< main_~i~0 999)} is VALID [2022-04-15 12:26:43,948 INFO L290 TraceCheckUtils]: 88: Hoare triple {114023#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114023#(< main_~i~0 998)} is VALID [2022-04-15 12:26:43,949 INFO L290 TraceCheckUtils]: 87: Hoare triple {114030#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114023#(< main_~i~0 998)} is VALID [2022-04-15 12:26:43,949 INFO L290 TraceCheckUtils]: 86: Hoare triple {114030#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114030#(< main_~i~0 997)} is VALID [2022-04-15 12:26:43,949 INFO L290 TraceCheckUtils]: 85: Hoare triple {114037#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114030#(< main_~i~0 997)} is VALID [2022-04-15 12:26:43,949 INFO L290 TraceCheckUtils]: 84: Hoare triple {114037#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114037#(< main_~i~0 996)} is VALID [2022-04-15 12:26:43,950 INFO L290 TraceCheckUtils]: 83: Hoare triple {114044#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114037#(< main_~i~0 996)} is VALID [2022-04-15 12:26:43,950 INFO L290 TraceCheckUtils]: 82: Hoare triple {114044#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114044#(< main_~i~0 995)} is VALID [2022-04-15 12:26:43,950 INFO L290 TraceCheckUtils]: 81: Hoare triple {114051#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114044#(< main_~i~0 995)} is VALID [2022-04-15 12:26:43,951 INFO L290 TraceCheckUtils]: 80: Hoare triple {114051#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114051#(< main_~i~0 994)} is VALID [2022-04-15 12:26:43,951 INFO L290 TraceCheckUtils]: 79: Hoare triple {114058#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114051#(< main_~i~0 994)} is VALID [2022-04-15 12:26:43,951 INFO L290 TraceCheckUtils]: 78: Hoare triple {114058#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114058#(< main_~i~0 993)} is VALID [2022-04-15 12:26:43,952 INFO L290 TraceCheckUtils]: 77: Hoare triple {114065#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114058#(< main_~i~0 993)} is VALID [2022-04-15 12:26:43,952 INFO L290 TraceCheckUtils]: 76: Hoare triple {114065#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114065#(< main_~i~0 992)} is VALID [2022-04-15 12:26:43,952 INFO L290 TraceCheckUtils]: 75: Hoare triple {114072#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114065#(< main_~i~0 992)} is VALID [2022-04-15 12:26:43,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {114072#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114072#(< main_~i~0 991)} is VALID [2022-04-15 12:26:43,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {114079#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114072#(< main_~i~0 991)} is VALID [2022-04-15 12:26:43,953 INFO L290 TraceCheckUtils]: 72: Hoare triple {114079#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114079#(< main_~i~0 990)} is VALID [2022-04-15 12:26:43,954 INFO L290 TraceCheckUtils]: 71: Hoare triple {114086#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114079#(< main_~i~0 990)} is VALID [2022-04-15 12:26:43,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {114086#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114086#(< main_~i~0 989)} is VALID [2022-04-15 12:26:43,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {114093#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114086#(< main_~i~0 989)} is VALID [2022-04-15 12:26:43,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {114093#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114093#(< main_~i~0 988)} is VALID [2022-04-15 12:26:43,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {114100#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114093#(< main_~i~0 988)} is VALID [2022-04-15 12:26:43,955 INFO L290 TraceCheckUtils]: 66: Hoare triple {114100#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114100#(< main_~i~0 987)} is VALID [2022-04-15 12:26:43,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {114107#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114100#(< main_~i~0 987)} is VALID [2022-04-15 12:26:43,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {114107#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114107#(< main_~i~0 986)} is VALID [2022-04-15 12:26:43,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {114114#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114107#(< main_~i~0 986)} is VALID [2022-04-15 12:26:43,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {114114#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114114#(< main_~i~0 985)} is VALID [2022-04-15 12:26:43,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {114121#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114114#(< main_~i~0 985)} is VALID [2022-04-15 12:26:43,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {114121#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114121#(< main_~i~0 984)} is VALID [2022-04-15 12:26:43,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {114128#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114121#(< main_~i~0 984)} is VALID [2022-04-15 12:26:43,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {114128#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114128#(< main_~i~0 983)} is VALID [2022-04-15 12:26:43,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {114135#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114128#(< main_~i~0 983)} is VALID [2022-04-15 12:26:43,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {114135#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114135#(< main_~i~0 982)} is VALID [2022-04-15 12:26:43,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {114142#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114135#(< main_~i~0 982)} is VALID [2022-04-15 12:26:43,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {114142#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114142#(< main_~i~0 981)} is VALID [2022-04-15 12:26:43,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {114149#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114142#(< main_~i~0 981)} is VALID [2022-04-15 12:26:43,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {114149#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114149#(< main_~i~0 980)} is VALID [2022-04-15 12:26:43,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {114156#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114149#(< main_~i~0 980)} is VALID [2022-04-15 12:26:43,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {114156#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114156#(< main_~i~0 979)} is VALID [2022-04-15 12:26:43,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {114163#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114156#(< main_~i~0 979)} is VALID [2022-04-15 12:26:43,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {114163#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114163#(< main_~i~0 978)} is VALID [2022-04-15 12:26:43,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {114170#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114163#(< main_~i~0 978)} is VALID [2022-04-15 12:26:43,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {114170#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114170#(< main_~i~0 977)} is VALID [2022-04-15 12:26:43,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {114177#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114170#(< main_~i~0 977)} is VALID [2022-04-15 12:26:43,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {114177#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114177#(< main_~i~0 976)} is VALID [2022-04-15 12:26:43,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {114184#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114177#(< main_~i~0 976)} is VALID [2022-04-15 12:26:43,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {114184#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114184#(< main_~i~0 975)} is VALID [2022-04-15 12:26:43,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {114191#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114184#(< main_~i~0 975)} is VALID [2022-04-15 12:26:43,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {114191#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114191#(< main_~i~0 974)} is VALID [2022-04-15 12:26:43,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {114198#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114191#(< main_~i~0 974)} is VALID [2022-04-15 12:26:43,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {114198#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114198#(< main_~i~0 973)} is VALID [2022-04-15 12:26:43,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {114205#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114198#(< main_~i~0 973)} is VALID [2022-04-15 12:26:43,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {114205#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114205#(< main_~i~0 972)} is VALID [2022-04-15 12:26:43,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {114212#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114205#(< main_~i~0 972)} is VALID [2022-04-15 12:26:43,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {114212#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114212#(< main_~i~0 971)} is VALID [2022-04-15 12:26:43,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {114219#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114212#(< main_~i~0 971)} is VALID [2022-04-15 12:26:43,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {114219#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114219#(< main_~i~0 970)} is VALID [2022-04-15 12:26:43,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {114226#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114219#(< main_~i~0 970)} is VALID [2022-04-15 12:26:43,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {114226#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114226#(< main_~i~0 969)} is VALID [2022-04-15 12:26:43,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {114233#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114226#(< main_~i~0 969)} is VALID [2022-04-15 12:26:43,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {114233#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114233#(< main_~i~0 968)} is VALID [2022-04-15 12:26:43,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {114240#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114233#(< main_~i~0 968)} is VALID [2022-04-15 12:26:43,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {114240#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114240#(< main_~i~0 967)} is VALID [2022-04-15 12:26:43,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {114247#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114240#(< main_~i~0 967)} is VALID [2022-04-15 12:26:43,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {114247#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114247#(< main_~i~0 966)} is VALID [2022-04-15 12:26:43,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {114254#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114247#(< main_~i~0 966)} is VALID [2022-04-15 12:26:43,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {114254#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114254#(< main_~i~0 965)} is VALID [2022-04-15 12:26:43,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {114261#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114254#(< main_~i~0 965)} is VALID [2022-04-15 12:26:43,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {114261#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -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 964)} is VALID [2022-04-15 12:26:43,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {114268#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(< main_~i~0 964)} is VALID [2022-04-15 12:26:43,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {114268#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -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 963)} is VALID [2022-04-15 12:26:43,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {114275#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(< main_~i~0 963)} is VALID [2022-04-15 12:26:43,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {114275#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -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 962)} is VALID [2022-04-15 12:26:43,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {114282#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(< main_~i~0 962)} is VALID [2022-04-15 12:26:43,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {114282#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -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 961)} is VALID [2022-04-15 12:26:43,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {114289#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(< main_~i~0 961)} is VALID [2022-04-15 12:26:43,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {114289#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -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 960)} is VALID [2022-04-15 12:26:43,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {114296#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(< main_~i~0 960)} is VALID [2022-04-15 12:26:43,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {114296#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -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 959)} is VALID [2022-04-15 12:26:43,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {114303#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(< main_~i~0 959)} is VALID [2022-04-15 12:26:43,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {114303#(< main_~i~0 958)} assume !!(~i~0 < 1023);assume -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 958)} is VALID [2022-04-15 12:26:43,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {114310#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(< main_~i~0 958)} is VALID [2022-04-15 12:26:43,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {114310#(< main_~i~0 957)} assume !!(~i~0 < 1023);assume -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 957)} is VALID [2022-04-15 12:26:43,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {113282#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114310#(< main_~i~0 957)} is VALID [2022-04-15 12:26:43,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {113282#true} call #t~ret5 := main(); {113282#true} is VALID [2022-04-15 12:26:43,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 12:26:43,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 12:26:43,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {113282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {113282#true} is VALID [2022-04-15 12:26:43,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {113282#true} call ULTIMATE.init(); {113282#true} is VALID [2022-04-15 12:26:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4363 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:26:43,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606569188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:26:43,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:26:43,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 138 [2022-04-15 12:26:43,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:26:43,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670654261] [2022-04-15 12:26:43,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670654261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:43,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:43,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 12:26:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151245376] [2022-04-15 12:26:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:26:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 12:26:43,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:26:43,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:44,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:44,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 12:26:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 12:26:44,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9318, Invalid=9588, Unknown=0, NotChecked=0, Total=18906 [2022-04-15 12:26:44,070 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:00,639 INFO L93 Difference]: Finished difference Result 431 states and 498 transitions. [2022-04-15 12:27:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-15 12:27:00,639 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 12:27:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 493 transitions. [2022-04-15 12:27:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 493 transitions. [2022-04-15 12:27:00,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 493 transitions. [2022-04-15 12:27:00,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:00,989 INFO L225 Difference]: With dead ends: 431 [2022-04-15 12:27:00,989 INFO L226 Difference]: Without dead ends: 417 [2022-04-15 12:27:00,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=18498, Invalid=23322, Unknown=0, NotChecked=0, Total=41820 [2022-04-15 12:27:00,992 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1039 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:00,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1039 Valid, 56 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:27:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-15 12:27:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 155. [2022-04-15 12:27:02,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:02,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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-15 12:27:02,129 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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-15 12:27:02,129 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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-15 12:27:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,135 INFO L93 Difference]: Finished difference Result 417 states and 483 transitions. [2022-04-15 12:27:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 483 transitions. [2022-04-15 12:27:02,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:02,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:02,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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 417 states. [2022-04-15 12:27:02,136 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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 417 states. [2022-04-15 12:27:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,141 INFO L93 Difference]: Finished difference Result 417 states and 483 transitions. [2022-04-15 12:27:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 483 transitions. [2022-04-15 12:27:02,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:02,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:02,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:02,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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-15 12:27:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2022-04-15 12:27:02,143 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2022-04-15 12:27:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:02,144 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2022-04-15 12:27:02,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 156 transitions. [2022-04-15 12:27:02,515 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-15 12:27:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2022-04-15 12:27:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-15 12:27:02,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:02,516 INFO L499 BasicCegarLoop]: trace histogram [67, 67, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:02,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-15 12:27:02,716 WARN L460 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-15 12:27:02,716 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1196716651, now seen corresponding path program 135 times [2022-04-15 12:27:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:02,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1657290086] [2022-04-15 12:27:02,721 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:02,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1196716651, now seen corresponding path program 136 times [2022-04-15 12:27:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:02,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719372446] [2022-04-15 12:27:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:04,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {116547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {116474#true} is VALID [2022-04-15 12:27:04,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 12:27:04,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 12:27:04,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {116474#true} call ULTIMATE.init(); {116547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:04,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {116547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {116474#true} is VALID [2022-04-15 12:27:04,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 12:27:04,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 12:27:04,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {116474#true} call #t~ret5 := main(); {116474#true} is VALID [2022-04-15 12:27:04,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {116474#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {116479#(= main_~i~0 0)} is VALID [2022-04-15 12:27:04,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {116479#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116479#(= main_~i~0 0)} is VALID [2022-04-15 12:27:04,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {116479#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:04,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {116480#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:04,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {116480#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:04,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {116481#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:04,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {116481#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:04,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {116482#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:04,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {116482#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:04,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {116483#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:04,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {116483#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:04,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {116484#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:04,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {116484#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:04,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {116485#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:04,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {116485#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:04,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {116486#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:04,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {116486#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:04,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {116487#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:04,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {116487#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:04,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {116488#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:04,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {116488#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:04,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {116489#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:04,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {116489#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:04,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {116490#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:04,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {116490#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:04,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {116491#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:04,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {116491#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:04,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {116492#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:04,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {116492#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:04,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {116493#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:04,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {116493#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:04,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {116494#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:04,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {116494#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:04,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:04,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:04,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {116496#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:04,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {116496#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:04,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {116497#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:04,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {116497#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:04,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {116498#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:04,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {116498#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:04,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {116499#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:04,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {116499#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:04,353 INFO L290 TraceCheckUtils]: 48: Hoare triple {116500#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:04,353 INFO L290 TraceCheckUtils]: 49: Hoare triple {116500#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:04,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {116501#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:04,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {116501#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:04,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {116502#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:04,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {116502#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:04,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {116503#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:04,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {116503#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:04,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {116504#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:04,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {116504#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:04,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {116505#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:04,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {116505#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:04,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {116506#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:04,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {116506#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:04,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {116507#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:04,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {116507#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:04,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {116508#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:04,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {116508#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:04,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {116509#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:04,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {116509#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:04,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {116510#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:04,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {116510#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:04,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {116511#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:04,360 INFO L290 TraceCheckUtils]: 71: Hoare triple {116511#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:04,360 INFO L290 TraceCheckUtils]: 72: Hoare triple {116512#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:04,360 INFO L290 TraceCheckUtils]: 73: Hoare triple {116512#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:04,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {116513#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:04,361 INFO L290 TraceCheckUtils]: 75: Hoare triple {116513#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:04,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {116514#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:04,362 INFO L290 TraceCheckUtils]: 77: Hoare triple {116514#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:04,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {116515#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:04,362 INFO L290 TraceCheckUtils]: 79: Hoare triple {116515#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:04,363 INFO L290 TraceCheckUtils]: 80: Hoare triple {116516#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:04,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {116516#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:04,363 INFO L290 TraceCheckUtils]: 82: Hoare triple {116517#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:04,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {116517#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:04,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {116518#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:04,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {116518#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:04,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {116519#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:04,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {116519#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:04,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {116520#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:04,366 INFO L290 TraceCheckUtils]: 89: Hoare triple {116520#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:04,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {116521#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:04,366 INFO L290 TraceCheckUtils]: 91: Hoare triple {116521#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:04,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {116522#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:04,367 INFO L290 TraceCheckUtils]: 93: Hoare triple {116522#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:04,367 INFO L290 TraceCheckUtils]: 94: Hoare triple {116523#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:04,367 INFO L290 TraceCheckUtils]: 95: Hoare triple {116523#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:04,368 INFO L290 TraceCheckUtils]: 96: Hoare triple {116524#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:04,368 INFO L290 TraceCheckUtils]: 97: Hoare triple {116524#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:04,368 INFO L290 TraceCheckUtils]: 98: Hoare triple {116525#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:04,369 INFO L290 TraceCheckUtils]: 99: Hoare triple {116525#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:04,369 INFO L290 TraceCheckUtils]: 100: Hoare triple {116526#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:04,369 INFO L290 TraceCheckUtils]: 101: Hoare triple {116526#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:04,370 INFO L290 TraceCheckUtils]: 102: Hoare triple {116527#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:04,370 INFO L290 TraceCheckUtils]: 103: Hoare triple {116527#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:04,370 INFO L290 TraceCheckUtils]: 104: Hoare triple {116528#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:04,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {116528#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:04,371 INFO L290 TraceCheckUtils]: 106: Hoare triple {116529#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:04,371 INFO L290 TraceCheckUtils]: 107: Hoare triple {116529#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:04,372 INFO L290 TraceCheckUtils]: 108: Hoare triple {116530#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:04,372 INFO L290 TraceCheckUtils]: 109: Hoare triple {116530#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:04,372 INFO L290 TraceCheckUtils]: 110: Hoare triple {116531#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:04,373 INFO L290 TraceCheckUtils]: 111: Hoare triple {116531#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:04,373 INFO L290 TraceCheckUtils]: 112: Hoare triple {116532#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:04,373 INFO L290 TraceCheckUtils]: 113: Hoare triple {116532#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:04,373 INFO L290 TraceCheckUtils]: 114: Hoare triple {116533#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:04,374 INFO L290 TraceCheckUtils]: 115: Hoare triple {116533#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:04,374 INFO L290 TraceCheckUtils]: 116: Hoare triple {116534#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:04,374 INFO L290 TraceCheckUtils]: 117: Hoare triple {116534#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:04,375 INFO L290 TraceCheckUtils]: 118: Hoare triple {116535#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:04,375 INFO L290 TraceCheckUtils]: 119: Hoare triple {116535#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:04,375 INFO L290 TraceCheckUtils]: 120: Hoare triple {116536#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:04,376 INFO L290 TraceCheckUtils]: 121: Hoare triple {116536#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:04,376 INFO L290 TraceCheckUtils]: 122: Hoare triple {116537#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:04,376 INFO L290 TraceCheckUtils]: 123: Hoare triple {116537#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:04,377 INFO L290 TraceCheckUtils]: 124: Hoare triple {116538#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:04,377 INFO L290 TraceCheckUtils]: 125: Hoare triple {116538#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:04,377 INFO L290 TraceCheckUtils]: 126: Hoare triple {116539#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:04,378 INFO L290 TraceCheckUtils]: 127: Hoare triple {116539#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:04,378 INFO L290 TraceCheckUtils]: 128: Hoare triple {116540#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:04,378 INFO L290 TraceCheckUtils]: 129: Hoare triple {116540#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:04,378 INFO L290 TraceCheckUtils]: 130: Hoare triple {116541#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:04,379 INFO L290 TraceCheckUtils]: 131: Hoare triple {116541#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:04,379 INFO L290 TraceCheckUtils]: 132: Hoare triple {116542#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:04,380 INFO L290 TraceCheckUtils]: 133: Hoare triple {116542#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:04,380 INFO L290 TraceCheckUtils]: 134: Hoare triple {116543#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:04,380 INFO L290 TraceCheckUtils]: 135: Hoare triple {116543#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:04,380 INFO L290 TraceCheckUtils]: 136: Hoare triple {116544#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:04,381 INFO L290 TraceCheckUtils]: 137: Hoare triple {116544#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:04,381 INFO L290 TraceCheckUtils]: 138: Hoare triple {116545#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:04,381 INFO L290 TraceCheckUtils]: 139: Hoare triple {116545#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116546#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 140: Hoare triple {116546#(<= main_~i~0 67)} assume !(~i~0 < 1023); {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 141: Hoare triple {116475#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 142: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 143: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 144: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 145: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 146: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 147: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 148: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 149: Hoare triple {116475#false} assume !(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L272 TraceCheckUtils]: 150: Hoare triple {116475#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {116475#false} is VALID [2022-04-15 12:27:04,382 INFO L290 TraceCheckUtils]: 151: Hoare triple {116475#false} ~cond := #in~cond; {116475#false} is VALID [2022-04-15 12:27:04,383 INFO L290 TraceCheckUtils]: 152: Hoare triple {116475#false} assume 0 == ~cond; {116475#false} is VALID [2022-04-15 12:27:04,383 INFO L290 TraceCheckUtils]: 153: Hoare triple {116475#false} assume !false; {116475#false} is VALID [2022-04-15 12:27:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:27:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:04,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719372446] [2022-04-15 12:27:04,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719372446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:04,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830092699] [2022-04-15 12:27:04,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:27:04,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:04,384 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-15 12:27:04,385 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-15 12:27:04,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:27:04,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:04,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 12:27:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:04,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:05,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {116474#true} call ULTIMATE.init(); {116474#true} is VALID [2022-04-15 12:27:05,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {116474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {116474#true} is VALID [2022-04-15 12:27:05,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 12:27:05,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 12:27:05,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {116474#true} call #t~ret5 := main(); {116474#true} is VALID [2022-04-15 12:27:05,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {116474#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {116566#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:05,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {116566#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116566#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:05,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {116566#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {116480#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {116480#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {116481#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {116481#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:05,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {116482#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:05,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {116482#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:05,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {116483#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:05,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {116483#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:05,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {116484#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:05,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {116484#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:05,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {116485#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:05,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {116485#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:05,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {116486#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:05,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {116486#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:05,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {116487#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:05,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {116487#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:05,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {116488#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:05,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {116488#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:05,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {116489#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:05,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {116489#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:05,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {116490#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:05,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {116490#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:05,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {116491#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:05,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {116491#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:05,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {116492#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:05,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {116492#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:05,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {116493#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:05,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {116493#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:05,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {116494#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:05,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {116494#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:05,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:05,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:05,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {116496#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:05,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {116496#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:05,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {116497#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:05,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {116497#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:05,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {116498#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:05,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {116498#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:05,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {116499#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:05,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {116499#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:05,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {116500#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:05,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {116500#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:05,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {116501#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:05,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {116501#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:05,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {116502#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:05,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {116502#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:05,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {116503#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:05,755 INFO L290 TraceCheckUtils]: 55: Hoare triple {116503#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:05,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {116504#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:05,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {116504#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:05,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {116505#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:05,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {116505#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:05,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {116506#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:05,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {116506#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:05,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {116507#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:05,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {116507#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:05,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {116508#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:05,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {116508#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:05,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {116509#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:05,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {116509#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:05,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {116510#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:05,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {116510#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:05,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {116511#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:05,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {116511#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:05,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {116512#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:05,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {116512#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:05,761 INFO L290 TraceCheckUtils]: 74: Hoare triple {116513#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:05,761 INFO L290 TraceCheckUtils]: 75: Hoare triple {116513#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:05,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {116514#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:05,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {116514#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:05,762 INFO L290 TraceCheckUtils]: 78: Hoare triple {116515#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:05,762 INFO L290 TraceCheckUtils]: 79: Hoare triple {116515#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:05,763 INFO L290 TraceCheckUtils]: 80: Hoare triple {116516#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:05,763 INFO L290 TraceCheckUtils]: 81: Hoare triple {116516#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:05,763 INFO L290 TraceCheckUtils]: 82: Hoare triple {116517#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:05,764 INFO L290 TraceCheckUtils]: 83: Hoare triple {116517#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:05,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {116518#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:05,764 INFO L290 TraceCheckUtils]: 85: Hoare triple {116518#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:05,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {116519#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:05,765 INFO L290 TraceCheckUtils]: 87: Hoare triple {116519#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:05,765 INFO L290 TraceCheckUtils]: 88: Hoare triple {116520#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:05,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {116520#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:05,766 INFO L290 TraceCheckUtils]: 90: Hoare triple {116521#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:05,766 INFO L290 TraceCheckUtils]: 91: Hoare triple {116521#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:05,767 INFO L290 TraceCheckUtils]: 92: Hoare triple {116522#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:05,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {116522#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:05,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {116523#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:05,768 INFO L290 TraceCheckUtils]: 95: Hoare triple {116523#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:05,768 INFO L290 TraceCheckUtils]: 96: Hoare triple {116524#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:05,768 INFO L290 TraceCheckUtils]: 97: Hoare triple {116524#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:05,768 INFO L290 TraceCheckUtils]: 98: Hoare triple {116525#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:05,769 INFO L290 TraceCheckUtils]: 99: Hoare triple {116525#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:05,769 INFO L290 TraceCheckUtils]: 100: Hoare triple {116526#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:05,769 INFO L290 TraceCheckUtils]: 101: Hoare triple {116526#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:05,770 INFO L290 TraceCheckUtils]: 102: Hoare triple {116527#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:05,770 INFO L290 TraceCheckUtils]: 103: Hoare triple {116527#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:05,770 INFO L290 TraceCheckUtils]: 104: Hoare triple {116528#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:05,771 INFO L290 TraceCheckUtils]: 105: Hoare triple {116528#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:05,771 INFO L290 TraceCheckUtils]: 106: Hoare triple {116529#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:05,771 INFO L290 TraceCheckUtils]: 107: Hoare triple {116529#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:05,772 INFO L290 TraceCheckUtils]: 108: Hoare triple {116530#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:05,772 INFO L290 TraceCheckUtils]: 109: Hoare triple {116530#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:05,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {116531#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:05,773 INFO L290 TraceCheckUtils]: 111: Hoare triple {116531#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:05,773 INFO L290 TraceCheckUtils]: 112: Hoare triple {116532#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:05,773 INFO L290 TraceCheckUtils]: 113: Hoare triple {116532#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:05,774 INFO L290 TraceCheckUtils]: 114: Hoare triple {116533#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:05,774 INFO L290 TraceCheckUtils]: 115: Hoare triple {116533#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:05,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {116534#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:05,775 INFO L290 TraceCheckUtils]: 117: Hoare triple {116534#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:05,775 INFO L290 TraceCheckUtils]: 118: Hoare triple {116535#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:05,775 INFO L290 TraceCheckUtils]: 119: Hoare triple {116535#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:05,775 INFO L290 TraceCheckUtils]: 120: Hoare triple {116536#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:05,776 INFO L290 TraceCheckUtils]: 121: Hoare triple {116536#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:05,776 INFO L290 TraceCheckUtils]: 122: Hoare triple {116537#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:05,776 INFO L290 TraceCheckUtils]: 123: Hoare triple {116537#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:05,777 INFO L290 TraceCheckUtils]: 124: Hoare triple {116538#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:05,777 INFO L290 TraceCheckUtils]: 125: Hoare triple {116538#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:05,777 INFO L290 TraceCheckUtils]: 126: Hoare triple {116539#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:05,778 INFO L290 TraceCheckUtils]: 127: Hoare triple {116539#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:05,778 INFO L290 TraceCheckUtils]: 128: Hoare triple {116540#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:05,778 INFO L290 TraceCheckUtils]: 129: Hoare triple {116540#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:05,779 INFO L290 TraceCheckUtils]: 130: Hoare triple {116541#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:05,779 INFO L290 TraceCheckUtils]: 131: Hoare triple {116541#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:05,779 INFO L290 TraceCheckUtils]: 132: Hoare triple {116542#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:05,780 INFO L290 TraceCheckUtils]: 133: Hoare triple {116542#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:05,780 INFO L290 TraceCheckUtils]: 134: Hoare triple {116543#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:05,780 INFO L290 TraceCheckUtils]: 135: Hoare triple {116543#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:05,781 INFO L290 TraceCheckUtils]: 136: Hoare triple {116544#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:05,781 INFO L290 TraceCheckUtils]: 137: Hoare triple {116544#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:05,781 INFO L290 TraceCheckUtils]: 138: Hoare triple {116545#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 139: Hoare triple {116545#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116546#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 140: Hoare triple {116546#(<= main_~i~0 67)} assume !(~i~0 < 1023); {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 141: Hoare triple {116475#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 142: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 144: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 145: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 146: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 147: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 148: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:05,782 INFO L290 TraceCheckUtils]: 149: Hoare triple {116475#false} assume !(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:05,783 INFO L272 TraceCheckUtils]: 150: Hoare triple {116475#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {116475#false} is VALID [2022-04-15 12:27:05,783 INFO L290 TraceCheckUtils]: 151: Hoare triple {116475#false} ~cond := #in~cond; {116475#false} is VALID [2022-04-15 12:27:05,783 INFO L290 TraceCheckUtils]: 152: Hoare triple {116475#false} assume 0 == ~cond; {116475#false} is VALID [2022-04-15 12:27:05,783 INFO L290 TraceCheckUtils]: 153: Hoare triple {116475#false} assume !false; {116475#false} is VALID [2022-04-15 12:27:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:27:05,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:10,813 INFO L290 TraceCheckUtils]: 153: Hoare triple {116475#false} assume !false; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 152: Hoare triple {116475#false} assume 0 == ~cond; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 151: Hoare triple {116475#false} ~cond := #in~cond; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L272 TraceCheckUtils]: 150: Hoare triple {116475#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 149: Hoare triple {116475#false} assume !(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 148: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 147: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 146: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 145: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 144: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 143: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 142: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 12:27:10,814 INFO L290 TraceCheckUtils]: 141: Hoare triple {116475#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {116475#false} is VALID [2022-04-15 12:27:10,815 INFO L290 TraceCheckUtils]: 140: Hoare triple {117050#(< main_~i~0 1023)} assume !(~i~0 < 1023); {116475#false} is VALID [2022-04-15 12:27:10,815 INFO L290 TraceCheckUtils]: 139: Hoare triple {117054#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117050#(< main_~i~0 1023)} is VALID [2022-04-15 12:27:10,815 INFO L290 TraceCheckUtils]: 138: Hoare triple {117054#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117054#(< main_~i~0 1022)} is VALID [2022-04-15 12:27:10,816 INFO L290 TraceCheckUtils]: 137: Hoare triple {117061#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117054#(< main_~i~0 1022)} is VALID [2022-04-15 12:27:10,816 INFO L290 TraceCheckUtils]: 136: Hoare triple {117061#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117061#(< main_~i~0 1021)} is VALID [2022-04-15 12:27:10,816 INFO L290 TraceCheckUtils]: 135: Hoare triple {117068#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117061#(< main_~i~0 1021)} is VALID [2022-04-15 12:27:10,817 INFO L290 TraceCheckUtils]: 134: Hoare triple {117068#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117068#(< main_~i~0 1020)} is VALID [2022-04-15 12:27:10,817 INFO L290 TraceCheckUtils]: 133: Hoare triple {117075#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117068#(< main_~i~0 1020)} is VALID [2022-04-15 12:27:10,817 INFO L290 TraceCheckUtils]: 132: Hoare triple {117075#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117075#(< main_~i~0 1019)} is VALID [2022-04-15 12:27:10,818 INFO L290 TraceCheckUtils]: 131: Hoare triple {117082#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117075#(< main_~i~0 1019)} is VALID [2022-04-15 12:27:10,818 INFO L290 TraceCheckUtils]: 130: Hoare triple {117082#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117082#(< main_~i~0 1018)} is VALID [2022-04-15 12:27:10,818 INFO L290 TraceCheckUtils]: 129: Hoare triple {117089#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117082#(< main_~i~0 1018)} is VALID [2022-04-15 12:27:10,819 INFO L290 TraceCheckUtils]: 128: Hoare triple {117089#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117089#(< main_~i~0 1017)} is VALID [2022-04-15 12:27:10,819 INFO L290 TraceCheckUtils]: 127: Hoare triple {117096#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117089#(< main_~i~0 1017)} is VALID [2022-04-15 12:27:10,819 INFO L290 TraceCheckUtils]: 126: Hoare triple {117096#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117096#(< main_~i~0 1016)} is VALID [2022-04-15 12:27:10,820 INFO L290 TraceCheckUtils]: 125: Hoare triple {117103#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117096#(< main_~i~0 1016)} is VALID [2022-04-15 12:27:10,820 INFO L290 TraceCheckUtils]: 124: Hoare triple {117103#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117103#(< main_~i~0 1015)} is VALID [2022-04-15 12:27:10,820 INFO L290 TraceCheckUtils]: 123: Hoare triple {117110#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117103#(< main_~i~0 1015)} is VALID [2022-04-15 12:27:10,821 INFO L290 TraceCheckUtils]: 122: Hoare triple {117110#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117110#(< main_~i~0 1014)} is VALID [2022-04-15 12:27:10,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {117117#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117110#(< main_~i~0 1014)} is VALID [2022-04-15 12:27:10,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {117117#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117117#(< main_~i~0 1013)} is VALID [2022-04-15 12:27:10,822 INFO L290 TraceCheckUtils]: 119: Hoare triple {117124#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117117#(< main_~i~0 1013)} is VALID [2022-04-15 12:27:10,822 INFO L290 TraceCheckUtils]: 118: Hoare triple {117124#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117124#(< main_~i~0 1012)} is VALID [2022-04-15 12:27:10,822 INFO L290 TraceCheckUtils]: 117: Hoare triple {117131#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117124#(< main_~i~0 1012)} is VALID [2022-04-15 12:27:10,822 INFO L290 TraceCheckUtils]: 116: Hoare triple {117131#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117131#(< main_~i~0 1011)} is VALID [2022-04-15 12:27:10,823 INFO L290 TraceCheckUtils]: 115: Hoare triple {117138#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117131#(< main_~i~0 1011)} is VALID [2022-04-15 12:27:10,823 INFO L290 TraceCheckUtils]: 114: Hoare triple {117138#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117138#(< main_~i~0 1010)} is VALID [2022-04-15 12:27:10,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {117145#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117138#(< main_~i~0 1010)} is VALID [2022-04-15 12:27:10,824 INFO L290 TraceCheckUtils]: 112: Hoare triple {117145#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117145#(< main_~i~0 1009)} is VALID [2022-04-15 12:27:10,824 INFO L290 TraceCheckUtils]: 111: Hoare triple {117152#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117145#(< main_~i~0 1009)} is VALID [2022-04-15 12:27:10,824 INFO L290 TraceCheckUtils]: 110: Hoare triple {117152#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117152#(< main_~i~0 1008)} is VALID [2022-04-15 12:27:10,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {117159#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117152#(< main_~i~0 1008)} is VALID [2022-04-15 12:27:10,825 INFO L290 TraceCheckUtils]: 108: Hoare triple {117159#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117159#(< main_~i~0 1007)} is VALID [2022-04-15 12:27:10,825 INFO L290 TraceCheckUtils]: 107: Hoare triple {117166#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117159#(< main_~i~0 1007)} is VALID [2022-04-15 12:27:10,826 INFO L290 TraceCheckUtils]: 106: Hoare triple {117166#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117166#(< main_~i~0 1006)} is VALID [2022-04-15 12:27:10,826 INFO L290 TraceCheckUtils]: 105: Hoare triple {117173#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117166#(< main_~i~0 1006)} is VALID [2022-04-15 12:27:10,826 INFO L290 TraceCheckUtils]: 104: Hoare triple {117173#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117173#(< main_~i~0 1005)} is VALID [2022-04-15 12:27:10,827 INFO L290 TraceCheckUtils]: 103: Hoare triple {117180#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117173#(< main_~i~0 1005)} is VALID [2022-04-15 12:27:10,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {117180#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117180#(< main_~i~0 1004)} is VALID [2022-04-15 12:27:10,827 INFO L290 TraceCheckUtils]: 101: Hoare triple {117187#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117180#(< main_~i~0 1004)} is VALID [2022-04-15 12:27:10,828 INFO L290 TraceCheckUtils]: 100: Hoare triple {117187#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117187#(< main_~i~0 1003)} is VALID [2022-04-15 12:27:10,828 INFO L290 TraceCheckUtils]: 99: Hoare triple {117194#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117187#(< main_~i~0 1003)} is VALID [2022-04-15 12:27:10,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {117194#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117194#(< main_~i~0 1002)} is VALID [2022-04-15 12:27:10,829 INFO L290 TraceCheckUtils]: 97: Hoare triple {117201#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117194#(< main_~i~0 1002)} is VALID [2022-04-15 12:27:10,829 INFO L290 TraceCheckUtils]: 96: Hoare triple {117201#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117201#(< main_~i~0 1001)} is VALID [2022-04-15 12:27:10,829 INFO L290 TraceCheckUtils]: 95: Hoare triple {117208#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117201#(< main_~i~0 1001)} is VALID [2022-04-15 12:27:10,830 INFO L290 TraceCheckUtils]: 94: Hoare triple {117208#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117208#(< main_~i~0 1000)} is VALID [2022-04-15 12:27:10,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {117215#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117208#(< main_~i~0 1000)} is VALID [2022-04-15 12:27:10,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {117215#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117215#(< main_~i~0 999)} is VALID [2022-04-15 12:27:10,831 INFO L290 TraceCheckUtils]: 91: Hoare triple {117222#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117215#(< main_~i~0 999)} is VALID [2022-04-15 12:27:10,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {117222#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117222#(< main_~i~0 998)} is VALID [2022-04-15 12:27:10,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {117229#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117222#(< main_~i~0 998)} is VALID [2022-04-15 12:27:10,832 INFO L290 TraceCheckUtils]: 88: Hoare triple {117229#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117229#(< main_~i~0 997)} is VALID [2022-04-15 12:27:10,832 INFO L290 TraceCheckUtils]: 87: Hoare triple {117236#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117229#(< main_~i~0 997)} is VALID [2022-04-15 12:27:10,832 INFO L290 TraceCheckUtils]: 86: Hoare triple {117236#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117236#(< main_~i~0 996)} is VALID [2022-04-15 12:27:10,833 INFO L290 TraceCheckUtils]: 85: Hoare triple {117243#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117236#(< main_~i~0 996)} is VALID [2022-04-15 12:27:10,833 INFO L290 TraceCheckUtils]: 84: Hoare triple {117243#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117243#(< main_~i~0 995)} is VALID [2022-04-15 12:27:10,833 INFO L290 TraceCheckUtils]: 83: Hoare triple {117250#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117243#(< main_~i~0 995)} is VALID [2022-04-15 12:27:10,833 INFO L290 TraceCheckUtils]: 82: Hoare triple {117250#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117250#(< main_~i~0 994)} is VALID [2022-04-15 12:27:10,834 INFO L290 TraceCheckUtils]: 81: Hoare triple {117257#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117250#(< main_~i~0 994)} is VALID [2022-04-15 12:27:10,834 INFO L290 TraceCheckUtils]: 80: Hoare triple {117257#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117257#(< main_~i~0 993)} is VALID [2022-04-15 12:27:10,834 INFO L290 TraceCheckUtils]: 79: Hoare triple {117264#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117257#(< main_~i~0 993)} is VALID [2022-04-15 12:27:10,835 INFO L290 TraceCheckUtils]: 78: Hoare triple {117264#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117264#(< main_~i~0 992)} is VALID [2022-04-15 12:27:10,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {117271#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117264#(< main_~i~0 992)} is VALID [2022-04-15 12:27:10,835 INFO L290 TraceCheckUtils]: 76: Hoare triple {117271#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117271#(< main_~i~0 991)} is VALID [2022-04-15 12:27:10,836 INFO L290 TraceCheckUtils]: 75: Hoare triple {117278#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117271#(< main_~i~0 991)} is VALID [2022-04-15 12:27:10,836 INFO L290 TraceCheckUtils]: 74: Hoare triple {117278#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117278#(< main_~i~0 990)} is VALID [2022-04-15 12:27:10,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {117285#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117278#(< main_~i~0 990)} is VALID [2022-04-15 12:27:10,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {117285#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117285#(< main_~i~0 989)} is VALID [2022-04-15 12:27:10,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {117292#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117285#(< main_~i~0 989)} is VALID [2022-04-15 12:27:10,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {117292#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117292#(< main_~i~0 988)} is VALID [2022-04-15 12:27:10,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {117299#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117292#(< main_~i~0 988)} is VALID [2022-04-15 12:27:10,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {117299#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117299#(< main_~i~0 987)} is VALID [2022-04-15 12:27:10,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {117306#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117299#(< main_~i~0 987)} is VALID [2022-04-15 12:27:10,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {117306#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117306#(< main_~i~0 986)} is VALID [2022-04-15 12:27:10,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {117313#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117306#(< main_~i~0 986)} is VALID [2022-04-15 12:27:10,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {117313#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117313#(< main_~i~0 985)} is VALID [2022-04-15 12:27:10,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {117320#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117313#(< main_~i~0 985)} is VALID [2022-04-15 12:27:10,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {117320#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117320#(< main_~i~0 984)} is VALID [2022-04-15 12:27:10,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {117327#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117320#(< main_~i~0 984)} is VALID [2022-04-15 12:27:10,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {117327#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117327#(< main_~i~0 983)} is VALID [2022-04-15 12:27:10,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {117334#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117327#(< main_~i~0 983)} is VALID [2022-04-15 12:27:10,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {117334#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117334#(< main_~i~0 982)} is VALID [2022-04-15 12:27:10,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {117341#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117334#(< main_~i~0 982)} is VALID [2022-04-15 12:27:10,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {117341#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117341#(< main_~i~0 981)} is VALID [2022-04-15 12:27:10,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {117348#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117341#(< main_~i~0 981)} is VALID [2022-04-15 12:27:10,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {117348#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117348#(< main_~i~0 980)} is VALID [2022-04-15 12:27:10,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {117355#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117348#(< main_~i~0 980)} is VALID [2022-04-15 12:27:10,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {117355#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117355#(< main_~i~0 979)} is VALID [2022-04-15 12:27:10,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {117362#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117355#(< main_~i~0 979)} is VALID [2022-04-15 12:27:10,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {117362#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117362#(< main_~i~0 978)} is VALID [2022-04-15 12:27:10,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {117369#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117362#(< main_~i~0 978)} is VALID [2022-04-15 12:27:10,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {117369#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117369#(< main_~i~0 977)} is VALID [2022-04-15 12:27:10,845 INFO L290 TraceCheckUtils]: 47: Hoare triple {117376#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117369#(< main_~i~0 977)} is VALID [2022-04-15 12:27:10,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {117376#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117376#(< main_~i~0 976)} is VALID [2022-04-15 12:27:10,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {117383#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117376#(< main_~i~0 976)} is VALID [2022-04-15 12:27:10,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {117383#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117383#(< main_~i~0 975)} is VALID [2022-04-15 12:27:10,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {117390#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117383#(< main_~i~0 975)} is VALID [2022-04-15 12:27:10,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {117390#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117390#(< main_~i~0 974)} is VALID [2022-04-15 12:27:10,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {117397#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117390#(< main_~i~0 974)} is VALID [2022-04-15 12:27:10,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {117397#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117397#(< main_~i~0 973)} is VALID [2022-04-15 12:27:10,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {117404#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117397#(< main_~i~0 973)} is VALID [2022-04-15 12:27:10,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {117404#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117404#(< main_~i~0 972)} is VALID [2022-04-15 12:27:10,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {117411#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117404#(< main_~i~0 972)} is VALID [2022-04-15 12:27:10,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {117411#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117411#(< main_~i~0 971)} is VALID [2022-04-15 12:27:10,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {117418#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117411#(< main_~i~0 971)} is VALID [2022-04-15 12:27:10,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {117418#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117418#(< main_~i~0 970)} is VALID [2022-04-15 12:27:10,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {117425#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117418#(< main_~i~0 970)} is VALID [2022-04-15 12:27:10,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {117425#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117425#(< main_~i~0 969)} is VALID [2022-04-15 12:27:10,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {117432#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117425#(< main_~i~0 969)} is VALID [2022-04-15 12:27:10,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {117432#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117432#(< main_~i~0 968)} is VALID [2022-04-15 12:27:10,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {117439#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117432#(< main_~i~0 968)} is VALID [2022-04-15 12:27:10,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {117439#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117439#(< main_~i~0 967)} is VALID [2022-04-15 12:27:10,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {117446#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117439#(< main_~i~0 967)} is VALID [2022-04-15 12:27:10,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {117446#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117446#(< main_~i~0 966)} is VALID [2022-04-15 12:27:10,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {117453#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117446#(< main_~i~0 966)} is VALID [2022-04-15 12:27:10,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {117453#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117453#(< main_~i~0 965)} is VALID [2022-04-15 12:27:10,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {117460#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117453#(< main_~i~0 965)} is VALID [2022-04-15 12:27:10,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {117460#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117460#(< main_~i~0 964)} is VALID [2022-04-15 12:27:10,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {117467#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117460#(< main_~i~0 964)} is VALID [2022-04-15 12:27:10,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {117467#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117467#(< main_~i~0 963)} is VALID [2022-04-15 12:27:10,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {117474#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117467#(< main_~i~0 963)} is VALID [2022-04-15 12:27:10,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {117474#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117474#(< main_~i~0 962)} is VALID [2022-04-15 12:27:10,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {117481#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117474#(< main_~i~0 962)} is VALID [2022-04-15 12:27:10,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {117481#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117481#(< main_~i~0 961)} is VALID [2022-04-15 12:27:10,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {117488#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117481#(< main_~i~0 961)} is VALID [2022-04-15 12:27:10,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {117488#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117488#(< main_~i~0 960)} is VALID [2022-04-15 12:27:10,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {117495#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117488#(< main_~i~0 960)} is VALID [2022-04-15 12:27:10,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {117495#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117495#(< main_~i~0 959)} is VALID [2022-04-15 12:27:10,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {117502#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117495#(< main_~i~0 959)} is VALID [2022-04-15 12:27:10,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {117502#(< main_~i~0 958)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117502#(< main_~i~0 958)} is VALID [2022-04-15 12:27:10,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {117509#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117502#(< main_~i~0 958)} is VALID [2022-04-15 12:27:10,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {117509#(< main_~i~0 957)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117509#(< main_~i~0 957)} is VALID [2022-04-15 12:27:10,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {117516#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117509#(< main_~i~0 957)} is VALID [2022-04-15 12:27:10,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {117516#(< main_~i~0 956)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117516#(< main_~i~0 956)} is VALID [2022-04-15 12:27:10,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {116474#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117516#(< main_~i~0 956)} is VALID [2022-04-15 12:27:10,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {116474#true} call #t~ret5 := main(); {116474#true} is VALID [2022-04-15 12:27:10,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 12:27:10,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 12:27:10,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {116474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {116474#true} is VALID [2022-04-15 12:27:10,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {116474#true} call ULTIMATE.init(); {116474#true} is VALID [2022-04-15 12:27:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:27:10,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830092699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:10,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 140 [2022-04-15 12:27:10,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:10,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1657290086] [2022-04-15 12:27:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1657290086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-15 12:27:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917692832] [2022-04-15 12:27:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:10,860 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-15 12:27:10,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:10,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:10,957 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-15 12:27:10,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-15 12:27:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-15 12:27:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9593, Invalid=9867, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 12:27:10,959 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:28,387 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2022-04-15 12:27:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 12:27:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-15 12:27:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 500 transitions. [2022-04-15 12:27:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 500 transitions. [2022-04-15 12:27:28,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 500 transitions. [2022-04-15 12:27:28,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:28,751 INFO L225 Difference]: With dead ends: 437 [2022-04-15 12:27:28,751 INFO L226 Difference]: Without dead ends: 423 [2022-04-15 12:27:28,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=19046, Invalid=24010, Unknown=0, NotChecked=0, Total=43056 [2022-04-15 12:27:28,754 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1125 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:28,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1125 Valid, 31 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:27:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-15 12:27:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 157. [2022-04-15 12:27:29,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:29,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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-15 12:27:29,950 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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-15 12:27:29,950 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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-15 12:27:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:29,956 INFO L93 Difference]: Finished difference Result 423 states and 490 transitions. [2022-04-15 12:27:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 490 transitions. [2022-04-15 12:27:29,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:29,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:29,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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 423 states. [2022-04-15 12:27:29,957 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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 423 states. [2022-04-15 12:27:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:29,965 INFO L93 Difference]: Finished difference Result 423 states and 490 transitions. [2022-04-15 12:27:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 490 transitions. [2022-04-15 12:27:29,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:29,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:29,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:29,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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-15 12:27:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-15 12:27:29,968 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2022-04-15 12:27:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:29,968 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-15 12:27:29,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:29,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-15 12:27:30,369 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-15 12:27:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-15 12:27:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 12:27:30,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:30,370 INFO L499 BasicCegarLoop]: trace histogram [68, 68, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:30,388 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-15 12:27:30,570 WARN L460 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-15 12:27:30,570 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -755811529, now seen corresponding path program 137 times [2022-04-15 12:27:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:30,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1094883402] [2022-04-15 12:27:30,574 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:30,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash -755811529, now seen corresponding path program 138 times [2022-04-15 12:27:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:30,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384388170] [2022-04-15 12:27:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:32,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {119784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {119710#true} is VALID [2022-04-15 12:27:32,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 12:27:32,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 12:27:32,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {119710#true} call ULTIMATE.init(); {119784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:32,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {119784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {119710#true} is VALID [2022-04-15 12:27:32,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 12:27:32,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 12:27:32,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {119710#true} call #t~ret5 := main(); {119710#true} is VALID [2022-04-15 12:27:32,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {119710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {119715#(= main_~i~0 0)} is VALID [2022-04-15 12:27:32,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {119715#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119715#(= main_~i~0 0)} is VALID [2022-04-15 12:27:32,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {119715#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:32,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {119716#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:32,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {119716#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:32,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {119717#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:32,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {119717#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119718#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:32,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {119718#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119718#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:32,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {119718#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119719#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:32,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {119719#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119719#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:32,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {119719#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119720#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:32,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {119720#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119720#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:32,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {119720#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119721#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:32,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {119721#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119721#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:32,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {119721#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119722#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:32,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {119722#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119722#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:32,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {119722#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119723#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:32,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {119723#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119723#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:32,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {119723#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119724#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:32,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {119724#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119724#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:32,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {119724#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119725#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:32,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {119725#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119725#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:32,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {119725#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119726#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:32,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {119726#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119726#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:32,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {119726#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119727#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:32,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {119727#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119727#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:32,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {119727#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119728#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:32,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {119728#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119728#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:32,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {119728#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119729#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:32,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {119729#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119729#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:32,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {119729#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119730#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:32,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {119730#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119730#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:32,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {119730#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119731#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:32,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {119731#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119731#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:32,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {119731#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119732#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:32,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {119732#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119732#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:32,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {119732#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119733#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:32,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {119733#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119733#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:32,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {119733#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119734#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:32,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {119734#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119734#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:32,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {119734#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119735#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:32,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {119735#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119735#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:32,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {119735#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119736#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:32,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {119736#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119736#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:32,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {119736#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119737#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:32,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {119737#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119737#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:32,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {119737#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119738#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:32,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {119738#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119738#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:32,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {119738#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119739#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:32,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {119739#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119739#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:32,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {119739#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119740#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:32,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {119740#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119740#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:32,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {119740#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119741#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:32,263 INFO L290 TraceCheckUtils]: 58: Hoare triple {119741#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119741#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:32,263 INFO L290 TraceCheckUtils]: 59: Hoare triple {119741#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119742#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:32,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {119742#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119742#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:32,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {119742#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119743#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:32,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {119743#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119743#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:32,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {119743#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119744#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:32,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {119744#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119744#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:32,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {119744#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119745#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:32,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {119745#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119745#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:32,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {119745#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119746#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:32,266 INFO L290 TraceCheckUtils]: 68: Hoare triple {119746#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119746#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:32,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {119746#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119747#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:32,267 INFO L290 TraceCheckUtils]: 70: Hoare triple {119747#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119747#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:32,267 INFO L290 TraceCheckUtils]: 71: Hoare triple {119747#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119748#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:32,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {119748#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119748#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:32,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {119748#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119749#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:32,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {119749#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119749#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:32,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {119749#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119750#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:32,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {119750#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119750#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:32,269 INFO L290 TraceCheckUtils]: 77: Hoare triple {119750#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119751#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:32,269 INFO L290 TraceCheckUtils]: 78: Hoare triple {119751#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119751#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:32,270 INFO L290 TraceCheckUtils]: 79: Hoare triple {119751#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119752#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:32,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {119752#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119752#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:32,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {119752#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119753#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:32,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {119753#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119753#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:32,271 INFO L290 TraceCheckUtils]: 83: Hoare triple {119753#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119754#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:32,271 INFO L290 TraceCheckUtils]: 84: Hoare triple {119754#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119754#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:32,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {119754#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119755#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:32,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {119755#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119755#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:32,272 INFO L290 TraceCheckUtils]: 87: Hoare triple {119755#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119756#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:32,273 INFO L290 TraceCheckUtils]: 88: Hoare triple {119756#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119756#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:32,273 INFO L290 TraceCheckUtils]: 89: Hoare triple {119756#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119757#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:32,273 INFO L290 TraceCheckUtils]: 90: Hoare triple {119757#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119757#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:32,274 INFO L290 TraceCheckUtils]: 91: Hoare triple {119757#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119758#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:32,274 INFO L290 TraceCheckUtils]: 92: Hoare triple {119758#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119758#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:32,274 INFO L290 TraceCheckUtils]: 93: Hoare triple {119758#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119759#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:32,275 INFO L290 TraceCheckUtils]: 94: Hoare triple {119759#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119759#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:32,275 INFO L290 TraceCheckUtils]: 95: Hoare triple {119759#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119760#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:32,275 INFO L290 TraceCheckUtils]: 96: Hoare triple {119760#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119760#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:32,276 INFO L290 TraceCheckUtils]: 97: Hoare triple {119760#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119761#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:32,276 INFO L290 TraceCheckUtils]: 98: Hoare triple {119761#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119761#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:32,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {119761#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119762#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:32,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {119762#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119762#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:32,277 INFO L290 TraceCheckUtils]: 101: Hoare triple {119762#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119763#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:32,277 INFO L290 TraceCheckUtils]: 102: Hoare triple {119763#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119763#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:32,277 INFO L290 TraceCheckUtils]: 103: Hoare triple {119763#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119764#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:32,278 INFO L290 TraceCheckUtils]: 104: Hoare triple {119764#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119764#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:32,278 INFO L290 TraceCheckUtils]: 105: Hoare triple {119764#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119765#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:32,278 INFO L290 TraceCheckUtils]: 106: Hoare triple {119765#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119765#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:32,279 INFO L290 TraceCheckUtils]: 107: Hoare triple {119765#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119766#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:32,279 INFO L290 TraceCheckUtils]: 108: Hoare triple {119766#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119766#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:32,279 INFO L290 TraceCheckUtils]: 109: Hoare triple {119766#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119767#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:32,280 INFO L290 TraceCheckUtils]: 110: Hoare triple {119767#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119767#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:32,280 INFO L290 TraceCheckUtils]: 111: Hoare triple {119767#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119768#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:32,280 INFO L290 TraceCheckUtils]: 112: Hoare triple {119768#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119768#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:32,281 INFO L290 TraceCheckUtils]: 113: Hoare triple {119768#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119769#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:32,281 INFO L290 TraceCheckUtils]: 114: Hoare triple {119769#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119769#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:32,281 INFO L290 TraceCheckUtils]: 115: Hoare triple {119769#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119770#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:32,282 INFO L290 TraceCheckUtils]: 116: Hoare triple {119770#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119770#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:32,282 INFO L290 TraceCheckUtils]: 117: Hoare triple {119770#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119771#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:32,282 INFO L290 TraceCheckUtils]: 118: Hoare triple {119771#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119771#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:32,283 INFO L290 TraceCheckUtils]: 119: Hoare triple {119771#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119772#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:32,283 INFO L290 TraceCheckUtils]: 120: Hoare triple {119772#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119772#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:32,283 INFO L290 TraceCheckUtils]: 121: Hoare triple {119772#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119773#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:32,284 INFO L290 TraceCheckUtils]: 122: Hoare triple {119773#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119773#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:32,284 INFO L290 TraceCheckUtils]: 123: Hoare triple {119773#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119774#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:32,284 INFO L290 TraceCheckUtils]: 124: Hoare triple {119774#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119774#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:32,285 INFO L290 TraceCheckUtils]: 125: Hoare triple {119774#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119775#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:32,285 INFO L290 TraceCheckUtils]: 126: Hoare triple {119775#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119775#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:32,285 INFO L290 TraceCheckUtils]: 127: Hoare triple {119775#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119776#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:32,286 INFO L290 TraceCheckUtils]: 128: Hoare triple {119776#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119776#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:32,286 INFO L290 TraceCheckUtils]: 129: Hoare triple {119776#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119777#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:32,286 INFO L290 TraceCheckUtils]: 130: Hoare triple {119777#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119777#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:32,287 INFO L290 TraceCheckUtils]: 131: Hoare triple {119777#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119778#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:32,287 INFO L290 TraceCheckUtils]: 132: Hoare triple {119778#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119778#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:32,287 INFO L290 TraceCheckUtils]: 133: Hoare triple {119778#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119779#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:32,287 INFO L290 TraceCheckUtils]: 134: Hoare triple {119779#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119779#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:32,288 INFO L290 TraceCheckUtils]: 135: Hoare triple {119779#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119780#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:32,288 INFO L290 TraceCheckUtils]: 136: Hoare triple {119780#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119780#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:32,288 INFO L290 TraceCheckUtils]: 137: Hoare triple {119780#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119781#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:32,289 INFO L290 TraceCheckUtils]: 138: Hoare triple {119781#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119781#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:32,289 INFO L290 TraceCheckUtils]: 139: Hoare triple {119781#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119782#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:32,289 INFO L290 TraceCheckUtils]: 140: Hoare triple {119782#(<= main_~i~0 67)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119782#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 141: Hoare triple {119782#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119783#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 142: Hoare triple {119783#(<= main_~i~0 68)} assume !(~i~0 < 1023); {119711#false} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 143: Hoare triple {119711#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {119711#false} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 144: Hoare triple {119711#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119711#false} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 145: Hoare triple {119711#false} assume !!(0 != #t~mem4);havoc #t~mem4; {119711#false} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 146: Hoare triple {119711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119711#false} is VALID [2022-04-15 12:27:32,290 INFO L290 TraceCheckUtils]: 147: Hoare triple {119711#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 148: Hoare triple {119711#false} assume !!(0 != #t~mem4);havoc #t~mem4; {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 149: Hoare triple {119711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 150: Hoare triple {119711#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 151: Hoare triple {119711#false} assume !(0 != #t~mem4);havoc #t~mem4; {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L272 TraceCheckUtils]: 152: Hoare triple {119711#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 153: Hoare triple {119711#false} ~cond := #in~cond; {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 154: Hoare triple {119711#false} assume 0 == ~cond; {119711#false} is VALID [2022-04-15 12:27:32,291 INFO L290 TraceCheckUtils]: 155: Hoare triple {119711#false} assume !false; {119711#false} is VALID [2022-04-15 12:27:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4631 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:27:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:32,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384388170] [2022-04-15 12:27:32,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384388170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:32,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553030763] [2022-04-15 12:27:32,292 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:27:32,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:32,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:32,293 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-15 12:27:32,293 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-15 12:27:32,779 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:27:32,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:32,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:27:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:32,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:33,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {119710#true} call ULTIMATE.init(); {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {119710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {119710#true} call #t~ret5 := main(); {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {119710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 66: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 71: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 74: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 79: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 80: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 81: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,146 INFO L290 TraceCheckUtils]: 82: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 83: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 84: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 85: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 86: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 91: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 92: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 95: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 96: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,147 INFO L290 TraceCheckUtils]: 97: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 99: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 100: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 101: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 105: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 106: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 107: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 108: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 109: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 110: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 111: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,148 INFO L290 TraceCheckUtils]: 112: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 113: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 114: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 115: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 116: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 118: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 119: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 120: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 121: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 122: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 123: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 124: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 125: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 126: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,149 INFO L290 TraceCheckUtils]: 127: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 128: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 129: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 130: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 131: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 132: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 133: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 134: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 135: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 136: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 137: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 138: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 139: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 140: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 141: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,150 INFO L290 TraceCheckUtils]: 142: Hoare triple {119710#true} assume !(~i~0 < 1023); {119710#true} is VALID [2022-04-15 12:27:33,151 INFO L290 TraceCheckUtils]: 143: Hoare triple {119710#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {120217#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:33,151 INFO L290 TraceCheckUtils]: 144: Hoare triple {120217#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120217#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:33,151 INFO L290 TraceCheckUtils]: 145: Hoare triple {120217#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {120217#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:33,152 INFO L290 TraceCheckUtils]: 146: Hoare triple {120217#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:33,152 INFO L290 TraceCheckUtils]: 147: Hoare triple {119716#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119716#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:33,152 INFO L290 TraceCheckUtils]: 148: Hoare triple {119716#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:33,153 INFO L290 TraceCheckUtils]: 149: Hoare triple {119716#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:33,153 INFO L290 TraceCheckUtils]: 150: Hoare triple {119717#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119717#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:33,153 INFO L290 TraceCheckUtils]: 151: Hoare triple {119717#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:33,154 INFO L272 TraceCheckUtils]: 152: Hoare triple {119717#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:27:33,154 INFO L290 TraceCheckUtils]: 153: Hoare triple {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {120249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:27:33,154 INFO L290 TraceCheckUtils]: 154: Hoare triple {120249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119711#false} is VALID [2022-04-15 12:27:33,154 INFO L290 TraceCheckUtils]: 155: Hoare triple {119711#false} assume !false; {119711#false} is VALID [2022-04-15 12:27:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4631 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-15 12:27:33,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:33,544 INFO L290 TraceCheckUtils]: 155: Hoare triple {119711#false} assume !false; {119711#false} is VALID [2022-04-15 12:27:33,544 INFO L290 TraceCheckUtils]: 154: Hoare triple {120249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119711#false} is VALID [2022-04-15 12:27:33,544 INFO L290 TraceCheckUtils]: 153: Hoare triple {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {120249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:27:33,545 INFO L272 TraceCheckUtils]: 152: Hoare triple {120265#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:27:33,545 INFO L290 TraceCheckUtils]: 151: Hoare triple {120265#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {120265#(<= main_~i~0 1024)} is VALID [2022-04-15 12:27:33,545 INFO L290 TraceCheckUtils]: 150: Hoare triple {120265#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120265#(<= main_~i~0 1024)} is VALID [2022-04-15 12:27:33,546 INFO L290 TraceCheckUtils]: 149: Hoare triple {120275#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {120265#(<= main_~i~0 1024)} is VALID [2022-04-15 12:27:33,546 INFO L290 TraceCheckUtils]: 148: Hoare triple {120275#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {120275#(<= main_~i~0 1023)} is VALID [2022-04-15 12:27:33,546 INFO L290 TraceCheckUtils]: 147: Hoare triple {120275#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120275#(<= main_~i~0 1023)} is VALID [2022-04-15 12:27:33,547 INFO L290 TraceCheckUtils]: 146: Hoare triple {120285#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {120275#(<= main_~i~0 1023)} is VALID [2022-04-15 12:27:33,547 INFO L290 TraceCheckUtils]: 145: Hoare triple {120285#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {120285#(<= main_~i~0 1022)} is VALID [2022-04-15 12:27:33,547 INFO L290 TraceCheckUtils]: 144: Hoare triple {120285#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120285#(<= main_~i~0 1022)} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 143: Hoare triple {119710#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {120285#(<= main_~i~0 1022)} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 142: Hoare triple {119710#true} assume !(~i~0 < 1023); {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 141: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 140: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 139: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 138: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 137: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 136: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 135: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 134: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 132: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,548 INFO L290 TraceCheckUtils]: 131: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 130: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 129: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 128: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 127: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 126: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 125: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 124: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 123: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 122: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 121: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 120: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 119: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 118: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 117: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,549 INFO L290 TraceCheckUtils]: 116: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 109: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 108: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 107: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 106: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 105: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 104: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 103: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 102: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,550 INFO L290 TraceCheckUtils]: 101: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 100: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 99: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 98: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 97: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 96: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 95: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 94: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 93: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 92: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 91: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 90: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 88: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,551 INFO L290 TraceCheckUtils]: 87: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 86: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 85: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 84: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 83: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 82: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 81: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 80: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 79: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 76: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 64: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {119710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {119710#true} call #t~ret5 := main(); {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {119710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {119710#true} call ULTIMATE.init(); {119710#true} is VALID [2022-04-15 12:27:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4631 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-15 12:27:33,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553030763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:33,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:33,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 7, 7] total 78 [2022-04-15 12:27:33,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:33,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1094883402] [2022-04-15 12:27:33,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1094883402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:33,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:33,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 12:27:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344184467] [2022-04-15 12:27:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-15 12:27:33,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:33,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:33,655 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-15 12:27:33,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 12:27:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 12:27:33,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2781, Invalid=3225, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 12:27:33,657 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,562 INFO L93 Difference]: Finished difference Result 443 states and 512 transitions. [2022-04-15 12:27:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 12:27:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-15 12:27:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 507 transitions. [2022-04-15 12:27:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 507 transitions. [2022-04-15 12:27:51,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 507 transitions. [2022-04-15 12:27:51,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:51,937 INFO L225 Difference]: With dead ends: 443 [2022-04-15 12:27:51,937 INFO L226 Difference]: Without dead ends: 429 [2022-04-15 12:27:51,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7957, Invalid=13505, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 12:27:51,939 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:51,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1145 Valid, 36 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:27:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-15 12:27:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 159. [2022-04-15 12:27:53,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:53,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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-15 12:27:53,197 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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-15 12:27:53,197 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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-15 12:27:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:53,205 INFO L93 Difference]: Finished difference Result 429 states and 497 transitions. [2022-04-15 12:27:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 497 transitions. [2022-04-15 12:27:53,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:53,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:53,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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 429 states. [2022-04-15 12:27:53,205 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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 429 states. [2022-04-15 12:27:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:53,211 INFO L93 Difference]: Finished difference Result 429 states and 497 transitions. [2022-04-15 12:27:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 497 transitions. [2022-04-15 12:27:53,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:53,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:53,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:53,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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-15 12:27:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-15 12:27:53,213 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2022-04-15 12:27:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:53,214 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-15 12:27:53,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:53,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-15 12:27:53,627 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-15 12:27:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-15 12:27:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-15 12:27:53,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:53,628 INFO L499 BasicCegarLoop]: trace histogram [69, 69, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:53,648 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-15 12:27:53,828 WARN L460 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-15 12:27:53,828 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2047215705, now seen corresponding path program 139 times [2022-04-15 12:27:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:53,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562342677] [2022-04-15 12:27:53,833 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:53,833 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2047215705, now seen corresponding path program 140 times [2022-04-15 12:27:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:53,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339867481] [2022-04-15 12:27:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:55,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {123001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {122926#true} is VALID [2022-04-15 12:27:55,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 12:27:55,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 12:27:55,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {122926#true} call ULTIMATE.init(); {123001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:55,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {123001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {122926#true} is VALID [2022-04-15 12:27:55,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 12:27:55,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 12:27:55,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {122926#true} call #t~ret5 := main(); {122926#true} is VALID [2022-04-15 12:27:55,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {122926#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {122931#(= main_~i~0 0)} is VALID [2022-04-15 12:27:55,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {122931#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122931#(= main_~i~0 0)} is VALID [2022-04-15 12:27:55,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {122931#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:55,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {122932#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:55,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {122932#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:55,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {122933#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:55,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {122933#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:55,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {122934#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:55,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {122934#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:55,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {122935#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:55,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {122935#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:55,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {122936#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:55,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {122936#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:55,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {122937#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:55,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {122937#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:55,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {122938#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:55,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {122938#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:55,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {122939#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:55,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {122939#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:55,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {122940#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:55,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {122940#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:55,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {122941#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:55,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {122941#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:55,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {122942#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:55,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {122942#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:55,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {122943#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:55,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {122943#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:55,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {122944#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:55,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {122944#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:55,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {122945#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:55,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {122945#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:55,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {122946#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:55,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {122946#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:55,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {122947#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:55,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {122947#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:55,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {122948#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:55,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {122948#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:55,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {122949#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:55,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {122949#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:55,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {122950#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:55,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {122950#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:55,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {122951#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:55,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {122951#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:55,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {122952#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:55,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {122952#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:55,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {122953#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:55,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {122953#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:55,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {122954#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:55,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {122954#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:55,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {122955#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:55,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {122955#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:55,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {122956#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:55,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {122956#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:55,590 INFO L290 TraceCheckUtils]: 58: Hoare triple {122957#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:55,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {122957#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:55,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {122958#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:55,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {122958#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:55,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {122959#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:55,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {122959#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:55,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {122960#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:55,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {122960#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:55,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {122961#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:55,593 INFO L290 TraceCheckUtils]: 67: Hoare triple {122961#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:55,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {122962#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:55,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {122962#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:55,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {122963#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:55,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {122963#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:55,594 INFO L290 TraceCheckUtils]: 72: Hoare triple {122964#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:55,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {122964#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:55,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {122965#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:55,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {122965#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:55,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {122966#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:55,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {122966#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:55,596 INFO L290 TraceCheckUtils]: 78: Hoare triple {122967#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:55,596 INFO L290 TraceCheckUtils]: 79: Hoare triple {122967#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:55,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {122968#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:55,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {122968#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:55,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {122969#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:55,598 INFO L290 TraceCheckUtils]: 83: Hoare triple {122969#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:55,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {122970#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:55,598 INFO L290 TraceCheckUtils]: 85: Hoare triple {122970#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:55,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {122971#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:55,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {122971#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:55,599 INFO L290 TraceCheckUtils]: 88: Hoare triple {122972#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:55,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {122972#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:55,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {122973#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:55,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {122973#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:55,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {122974#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:55,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {122974#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:55,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {122975#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:55,602 INFO L290 TraceCheckUtils]: 95: Hoare triple {122975#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:55,602 INFO L290 TraceCheckUtils]: 96: Hoare triple {122976#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:55,602 INFO L290 TraceCheckUtils]: 97: Hoare triple {122976#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:55,603 INFO L290 TraceCheckUtils]: 98: Hoare triple {122977#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:55,603 INFO L290 TraceCheckUtils]: 99: Hoare triple {122977#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:55,603 INFO L290 TraceCheckUtils]: 100: Hoare triple {122978#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:55,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {122978#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:55,604 INFO L290 TraceCheckUtils]: 102: Hoare triple {122979#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:55,604 INFO L290 TraceCheckUtils]: 103: Hoare triple {122979#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:55,604 INFO L290 TraceCheckUtils]: 104: Hoare triple {122980#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:55,605 INFO L290 TraceCheckUtils]: 105: Hoare triple {122980#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:55,605 INFO L290 TraceCheckUtils]: 106: Hoare triple {122981#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:55,605 INFO L290 TraceCheckUtils]: 107: Hoare triple {122981#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:55,606 INFO L290 TraceCheckUtils]: 108: Hoare triple {122982#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:55,606 INFO L290 TraceCheckUtils]: 109: Hoare triple {122982#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:55,606 INFO L290 TraceCheckUtils]: 110: Hoare triple {122983#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:55,607 INFO L290 TraceCheckUtils]: 111: Hoare triple {122983#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:55,607 INFO L290 TraceCheckUtils]: 112: Hoare triple {122984#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:55,607 INFO L290 TraceCheckUtils]: 113: Hoare triple {122984#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:55,608 INFO L290 TraceCheckUtils]: 114: Hoare triple {122985#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:55,608 INFO L290 TraceCheckUtils]: 115: Hoare triple {122985#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:55,608 INFO L290 TraceCheckUtils]: 116: Hoare triple {122986#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:55,609 INFO L290 TraceCheckUtils]: 117: Hoare triple {122986#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:55,609 INFO L290 TraceCheckUtils]: 118: Hoare triple {122987#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:55,609 INFO L290 TraceCheckUtils]: 119: Hoare triple {122987#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:55,610 INFO L290 TraceCheckUtils]: 120: Hoare triple {122988#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:55,610 INFO L290 TraceCheckUtils]: 121: Hoare triple {122988#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:55,610 INFO L290 TraceCheckUtils]: 122: Hoare triple {122989#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:55,611 INFO L290 TraceCheckUtils]: 123: Hoare triple {122989#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:55,611 INFO L290 TraceCheckUtils]: 124: Hoare triple {122990#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:55,611 INFO L290 TraceCheckUtils]: 125: Hoare triple {122990#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:55,612 INFO L290 TraceCheckUtils]: 126: Hoare triple {122991#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:55,612 INFO L290 TraceCheckUtils]: 127: Hoare triple {122991#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:55,612 INFO L290 TraceCheckUtils]: 128: Hoare triple {122992#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:55,613 INFO L290 TraceCheckUtils]: 129: Hoare triple {122992#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:55,613 INFO L290 TraceCheckUtils]: 130: Hoare triple {122993#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:55,613 INFO L290 TraceCheckUtils]: 131: Hoare triple {122993#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:55,614 INFO L290 TraceCheckUtils]: 132: Hoare triple {122994#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:55,614 INFO L290 TraceCheckUtils]: 133: Hoare triple {122994#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:55,614 INFO L290 TraceCheckUtils]: 134: Hoare triple {122995#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:55,615 INFO L290 TraceCheckUtils]: 135: Hoare triple {122995#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:55,615 INFO L290 TraceCheckUtils]: 136: Hoare triple {122996#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:55,615 INFO L290 TraceCheckUtils]: 137: Hoare triple {122996#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:55,615 INFO L290 TraceCheckUtils]: 138: Hoare triple {122997#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:55,616 INFO L290 TraceCheckUtils]: 139: Hoare triple {122997#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:55,616 INFO L290 TraceCheckUtils]: 140: Hoare triple {122998#(<= main_~i~0 67)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:55,616 INFO L290 TraceCheckUtils]: 141: Hoare triple {122998#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:55,617 INFO L290 TraceCheckUtils]: 142: Hoare triple {122999#(<= main_~i~0 68)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:55,617 INFO L290 TraceCheckUtils]: 143: Hoare triple {122999#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123000#(<= main_~i~0 69)} is VALID [2022-04-15 12:27:55,617 INFO L290 TraceCheckUtils]: 144: Hoare triple {123000#(<= main_~i~0 69)} assume !(~i~0 < 1023); {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 145: Hoare triple {122927#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 146: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 147: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 148: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 149: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 150: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 151: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 152: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 153: Hoare triple {122927#false} assume !(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L272 TraceCheckUtils]: 154: Hoare triple {122927#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 155: Hoare triple {122927#false} ~cond := #in~cond; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 156: Hoare triple {122927#false} assume 0 == ~cond; {122927#false} is VALID [2022-04-15 12:27:55,618 INFO L290 TraceCheckUtils]: 157: Hoare triple {122927#false} assume !false; {122927#false} is VALID [2022-04-15 12:27:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4768 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:27:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:55,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339867481] [2022-04-15 12:27:55,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339867481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:55,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501683886] [2022-04-15 12:27:55,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:27:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:55,635 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-15 12:27:55,636 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-15 12:27:56,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:27:56,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:56,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 12:27:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:56,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:57,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {122926#true} call ULTIMATE.init(); {122926#true} is VALID [2022-04-15 12:27:57,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {122926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {122926#true} is VALID [2022-04-15 12:27:57,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 12:27:57,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 12:27:57,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {122926#true} call #t~ret5 := main(); {122926#true} is VALID [2022-04-15 12:27:57,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {122926#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {123020#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:57,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {123020#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123020#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:57,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {123020#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:57,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {122932#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:57,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {122932#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:57,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {122933#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:57,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {122933#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:57,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {122934#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:57,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {122934#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:57,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {122935#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:57,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {122935#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:57,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {122936#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:57,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {122936#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:57,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {122937#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:57,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {122937#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:57,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {122938#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:57,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {122938#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:57,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {122939#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:57,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {122939#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:57,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {122940#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:57,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {122940#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:57,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {122941#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:57,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {122941#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:57,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {122942#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:57,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {122942#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:57,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {122943#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:57,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {122943#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:57,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {122944#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:57,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {122944#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:57,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {122945#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:57,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {122945#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:57,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {122946#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:57,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {122946#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:57,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {122947#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:57,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {122947#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:57,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {122948#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:57,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {122948#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:57,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {122949#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:57,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {122949#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:57,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {122950#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:57,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {122950#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:57,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {122951#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:57,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {122951#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:57,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {122952#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:57,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {122952#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:57,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {122953#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:57,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {122953#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:57,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {122954#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:57,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {122954#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:57,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {122955#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:57,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {122955#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:57,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {122956#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:57,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {122956#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:57,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {122957#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:57,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {122957#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:57,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {122958#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:57,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {122958#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:57,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {122959#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:57,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {122959#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:57,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {122960#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:57,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {122960#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:57,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {122961#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:57,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {122961#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:57,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {122962#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:57,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {122962#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:57,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {122963#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:57,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {122963#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:57,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {122964#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:57,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {122964#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:57,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {122965#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:57,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {122965#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:57,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {122966#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:57,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {122966#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:57,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {122967#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:57,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {122967#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:57,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {122968#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:57,077 INFO L290 TraceCheckUtils]: 81: Hoare triple {122968#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:57,077 INFO L290 TraceCheckUtils]: 82: Hoare triple {122969#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:57,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {122969#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:57,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {122970#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:57,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {122970#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:57,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {122971#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:57,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {122971#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:57,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {122972#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:57,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {122972#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:57,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {122973#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:57,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {122973#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:57,080 INFO L290 TraceCheckUtils]: 92: Hoare triple {122974#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:57,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {122974#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:57,081 INFO L290 TraceCheckUtils]: 94: Hoare triple {122975#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:57,081 INFO L290 TraceCheckUtils]: 95: Hoare triple {122975#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:57,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {122976#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:57,082 INFO L290 TraceCheckUtils]: 97: Hoare triple {122976#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:57,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {122977#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:57,082 INFO L290 TraceCheckUtils]: 99: Hoare triple {122977#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:57,083 INFO L290 TraceCheckUtils]: 100: Hoare triple {122978#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:57,083 INFO L290 TraceCheckUtils]: 101: Hoare triple {122978#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:57,083 INFO L290 TraceCheckUtils]: 102: Hoare triple {122979#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:57,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {122979#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:57,084 INFO L290 TraceCheckUtils]: 104: Hoare triple {122980#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:57,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {122980#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:57,085 INFO L290 TraceCheckUtils]: 106: Hoare triple {122981#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:57,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {122981#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:57,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {122982#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:57,086 INFO L290 TraceCheckUtils]: 109: Hoare triple {122982#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:57,086 INFO L290 TraceCheckUtils]: 110: Hoare triple {122983#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:57,086 INFO L290 TraceCheckUtils]: 111: Hoare triple {122983#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:57,086 INFO L290 TraceCheckUtils]: 112: Hoare triple {122984#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:57,087 INFO L290 TraceCheckUtils]: 113: Hoare triple {122984#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:57,087 INFO L290 TraceCheckUtils]: 114: Hoare triple {122985#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:57,087 INFO L290 TraceCheckUtils]: 115: Hoare triple {122985#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:57,088 INFO L290 TraceCheckUtils]: 116: Hoare triple {122986#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:57,088 INFO L290 TraceCheckUtils]: 117: Hoare triple {122986#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:57,088 INFO L290 TraceCheckUtils]: 118: Hoare triple {122987#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:57,089 INFO L290 TraceCheckUtils]: 119: Hoare triple {122987#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:57,089 INFO L290 TraceCheckUtils]: 120: Hoare triple {122988#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:57,089 INFO L290 TraceCheckUtils]: 121: Hoare triple {122988#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:57,090 INFO L290 TraceCheckUtils]: 122: Hoare triple {122989#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:57,090 INFO L290 TraceCheckUtils]: 123: Hoare triple {122989#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:57,090 INFO L290 TraceCheckUtils]: 124: Hoare triple {122990#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:57,091 INFO L290 TraceCheckUtils]: 125: Hoare triple {122990#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:57,091 INFO L290 TraceCheckUtils]: 126: Hoare triple {122991#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:57,091 INFO L290 TraceCheckUtils]: 127: Hoare triple {122991#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:57,092 INFO L290 TraceCheckUtils]: 128: Hoare triple {122992#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:57,092 INFO L290 TraceCheckUtils]: 129: Hoare triple {122992#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:57,092 INFO L290 TraceCheckUtils]: 130: Hoare triple {122993#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:57,093 INFO L290 TraceCheckUtils]: 131: Hoare triple {122993#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:57,093 INFO L290 TraceCheckUtils]: 132: Hoare triple {122994#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:57,093 INFO L290 TraceCheckUtils]: 133: Hoare triple {122994#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:57,094 INFO L290 TraceCheckUtils]: 134: Hoare triple {122995#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:57,094 INFO L290 TraceCheckUtils]: 135: Hoare triple {122995#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:57,094 INFO L290 TraceCheckUtils]: 136: Hoare triple {122996#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:57,095 INFO L290 TraceCheckUtils]: 137: Hoare triple {122996#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:57,095 INFO L290 TraceCheckUtils]: 138: Hoare triple {122997#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:57,095 INFO L290 TraceCheckUtils]: 139: Hoare triple {122997#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:57,096 INFO L290 TraceCheckUtils]: 140: Hoare triple {122998#(<= main_~i~0 67)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:57,096 INFO L290 TraceCheckUtils]: 141: Hoare triple {122998#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:57,096 INFO L290 TraceCheckUtils]: 142: Hoare triple {122999#(<= main_~i~0 68)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 143: Hoare triple {122999#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123000#(<= main_~i~0 69)} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 144: Hoare triple {123000#(<= main_~i~0 69)} assume !(~i~0 < 1023); {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 145: Hoare triple {122927#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 146: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 147: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 148: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 149: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 150: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 151: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 12:27:57,097 INFO L290 TraceCheckUtils]: 152: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:27:57,098 INFO L290 TraceCheckUtils]: 153: Hoare triple {122927#false} assume !(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:27:57,098 INFO L272 TraceCheckUtils]: 154: Hoare triple {122927#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {122927#false} is VALID [2022-04-15 12:27:57,098 INFO L290 TraceCheckUtils]: 155: Hoare triple {122927#false} ~cond := #in~cond; {122927#false} is VALID [2022-04-15 12:27:57,098 INFO L290 TraceCheckUtils]: 156: Hoare triple {122927#false} assume 0 == ~cond; {122927#false} is VALID [2022-04-15 12:27:57,098 INFO L290 TraceCheckUtils]: 157: Hoare triple {122927#false} assume !false; {122927#false} is VALID [2022-04-15 12:27:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4768 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:27:57,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:28:02,380 INFO L290 TraceCheckUtils]: 157: Hoare triple {122927#false} assume !false; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 156: Hoare triple {122927#false} assume 0 == ~cond; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 155: Hoare triple {122927#false} ~cond := #in~cond; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L272 TraceCheckUtils]: 154: Hoare triple {122927#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 153: Hoare triple {122927#false} assume !(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 152: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 151: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 150: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 149: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 148: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 147: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 146: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 12:28:02,381 INFO L290 TraceCheckUtils]: 145: Hoare triple {122927#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {122927#false} is VALID [2022-04-15 12:28:02,382 INFO L290 TraceCheckUtils]: 144: Hoare triple {123516#(< main_~i~0 1023)} assume !(~i~0 < 1023); {122927#false} is VALID [2022-04-15 12:28:02,382 INFO L290 TraceCheckUtils]: 143: Hoare triple {123520#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123516#(< main_~i~0 1023)} is VALID [2022-04-15 12:28:02,382 INFO L290 TraceCheckUtils]: 142: Hoare triple {123520#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123520#(< main_~i~0 1022)} is VALID [2022-04-15 12:28:02,383 INFO L290 TraceCheckUtils]: 141: Hoare triple {123527#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123520#(< main_~i~0 1022)} is VALID [2022-04-15 12:28:02,383 INFO L290 TraceCheckUtils]: 140: Hoare triple {123527#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123527#(< main_~i~0 1021)} is VALID [2022-04-15 12:28:02,383 INFO L290 TraceCheckUtils]: 139: Hoare triple {123534#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123527#(< main_~i~0 1021)} is VALID [2022-04-15 12:28:02,384 INFO L290 TraceCheckUtils]: 138: Hoare triple {123534#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123534#(< main_~i~0 1020)} is VALID [2022-04-15 12:28:02,384 INFO L290 TraceCheckUtils]: 137: Hoare triple {123541#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123534#(< main_~i~0 1020)} is VALID [2022-04-15 12:28:02,384 INFO L290 TraceCheckUtils]: 136: Hoare triple {123541#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123541#(< main_~i~0 1019)} is VALID [2022-04-15 12:28:02,385 INFO L290 TraceCheckUtils]: 135: Hoare triple {123548#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123541#(< main_~i~0 1019)} is VALID [2022-04-15 12:28:02,385 INFO L290 TraceCheckUtils]: 134: Hoare triple {123548#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123548#(< main_~i~0 1018)} is VALID [2022-04-15 12:28:02,385 INFO L290 TraceCheckUtils]: 133: Hoare triple {123555#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123548#(< main_~i~0 1018)} is VALID [2022-04-15 12:28:02,386 INFO L290 TraceCheckUtils]: 132: Hoare triple {123555#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123555#(< main_~i~0 1017)} is VALID [2022-04-15 12:28:02,386 INFO L290 TraceCheckUtils]: 131: Hoare triple {123562#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123555#(< main_~i~0 1017)} is VALID [2022-04-15 12:28:02,386 INFO L290 TraceCheckUtils]: 130: Hoare triple {123562#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123562#(< main_~i~0 1016)} is VALID [2022-04-15 12:28:02,387 INFO L290 TraceCheckUtils]: 129: Hoare triple {123569#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123562#(< main_~i~0 1016)} is VALID [2022-04-15 12:28:02,387 INFO L290 TraceCheckUtils]: 128: Hoare triple {123569#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123569#(< main_~i~0 1015)} is VALID [2022-04-15 12:28:02,387 INFO L290 TraceCheckUtils]: 127: Hoare triple {123576#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123569#(< main_~i~0 1015)} is VALID [2022-04-15 12:28:02,388 INFO L290 TraceCheckUtils]: 126: Hoare triple {123576#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123576#(< main_~i~0 1014)} is VALID [2022-04-15 12:28:02,388 INFO L290 TraceCheckUtils]: 125: Hoare triple {123583#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123576#(< main_~i~0 1014)} is VALID [2022-04-15 12:28:02,388 INFO L290 TraceCheckUtils]: 124: Hoare triple {123583#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123583#(< main_~i~0 1013)} is VALID [2022-04-15 12:28:02,389 INFO L290 TraceCheckUtils]: 123: Hoare triple {123590#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123583#(< main_~i~0 1013)} is VALID [2022-04-15 12:28:02,389 INFO L290 TraceCheckUtils]: 122: Hoare triple {123590#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123590#(< main_~i~0 1012)} is VALID [2022-04-15 12:28:02,389 INFO L290 TraceCheckUtils]: 121: Hoare triple {123597#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123590#(< main_~i~0 1012)} is VALID [2022-04-15 12:28:02,390 INFO L290 TraceCheckUtils]: 120: Hoare triple {123597#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123597#(< main_~i~0 1011)} is VALID [2022-04-15 12:28:02,390 INFO L290 TraceCheckUtils]: 119: Hoare triple {123604#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123597#(< main_~i~0 1011)} is VALID [2022-04-15 12:28:02,390 INFO L290 TraceCheckUtils]: 118: Hoare triple {123604#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123604#(< main_~i~0 1010)} is VALID [2022-04-15 12:28:02,391 INFO L290 TraceCheckUtils]: 117: Hoare triple {123611#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123604#(< main_~i~0 1010)} is VALID [2022-04-15 12:28:02,391 INFO L290 TraceCheckUtils]: 116: Hoare triple {123611#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123611#(< main_~i~0 1009)} is VALID [2022-04-15 12:28:02,391 INFO L290 TraceCheckUtils]: 115: Hoare triple {123618#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123611#(< main_~i~0 1009)} is VALID [2022-04-15 12:28:02,391 INFO L290 TraceCheckUtils]: 114: Hoare triple {123618#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123618#(< main_~i~0 1008)} is VALID [2022-04-15 12:28:02,392 INFO L290 TraceCheckUtils]: 113: Hoare triple {123625#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123618#(< main_~i~0 1008)} is VALID [2022-04-15 12:28:02,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {123625#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123625#(< main_~i~0 1007)} is VALID [2022-04-15 12:28:02,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {123632#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123625#(< main_~i~0 1007)} is VALID [2022-04-15 12:28:02,393 INFO L290 TraceCheckUtils]: 110: Hoare triple {123632#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123632#(< main_~i~0 1006)} is VALID [2022-04-15 12:28:02,393 INFO L290 TraceCheckUtils]: 109: Hoare triple {123639#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123632#(< main_~i~0 1006)} is VALID [2022-04-15 12:28:02,393 INFO L290 TraceCheckUtils]: 108: Hoare triple {123639#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123639#(< main_~i~0 1005)} is VALID [2022-04-15 12:28:02,394 INFO L290 TraceCheckUtils]: 107: Hoare triple {123646#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123639#(< main_~i~0 1005)} is VALID [2022-04-15 12:28:02,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {123646#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123646#(< main_~i~0 1004)} is VALID [2022-04-15 12:28:02,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {123653#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123646#(< main_~i~0 1004)} is VALID [2022-04-15 12:28:02,395 INFO L290 TraceCheckUtils]: 104: Hoare triple {123653#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123653#(< main_~i~0 1003)} is VALID [2022-04-15 12:28:02,395 INFO L290 TraceCheckUtils]: 103: Hoare triple {123660#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123653#(< main_~i~0 1003)} is VALID [2022-04-15 12:28:02,395 INFO L290 TraceCheckUtils]: 102: Hoare triple {123660#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123660#(< main_~i~0 1002)} is VALID [2022-04-15 12:28:02,396 INFO L290 TraceCheckUtils]: 101: Hoare triple {123667#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123660#(< main_~i~0 1002)} is VALID [2022-04-15 12:28:02,396 INFO L290 TraceCheckUtils]: 100: Hoare triple {123667#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123667#(< main_~i~0 1001)} is VALID [2022-04-15 12:28:02,396 INFO L290 TraceCheckUtils]: 99: Hoare triple {123674#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123667#(< main_~i~0 1001)} is VALID [2022-04-15 12:28:02,397 INFO L290 TraceCheckUtils]: 98: Hoare triple {123674#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123674#(< main_~i~0 1000)} is VALID [2022-04-15 12:28:02,397 INFO L290 TraceCheckUtils]: 97: Hoare triple {123681#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123674#(< main_~i~0 1000)} is VALID [2022-04-15 12:28:02,397 INFO L290 TraceCheckUtils]: 96: Hoare triple {123681#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123681#(< main_~i~0 999)} is VALID [2022-04-15 12:28:02,398 INFO L290 TraceCheckUtils]: 95: Hoare triple {123688#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123681#(< main_~i~0 999)} is VALID [2022-04-15 12:28:02,398 INFO L290 TraceCheckUtils]: 94: Hoare triple {123688#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123688#(< main_~i~0 998)} is VALID [2022-04-15 12:28:02,398 INFO L290 TraceCheckUtils]: 93: Hoare triple {123695#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123688#(< main_~i~0 998)} is VALID [2022-04-15 12:28:02,399 INFO L290 TraceCheckUtils]: 92: Hoare triple {123695#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123695#(< main_~i~0 997)} is VALID [2022-04-15 12:28:02,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {123702#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123695#(< main_~i~0 997)} is VALID [2022-04-15 12:28:02,399 INFO L290 TraceCheckUtils]: 90: Hoare triple {123702#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123702#(< main_~i~0 996)} is VALID [2022-04-15 12:28:02,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {123709#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123702#(< main_~i~0 996)} is VALID [2022-04-15 12:28:02,400 INFO L290 TraceCheckUtils]: 88: Hoare triple {123709#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123709#(< main_~i~0 995)} is VALID [2022-04-15 12:28:02,400 INFO L290 TraceCheckUtils]: 87: Hoare triple {123716#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123709#(< main_~i~0 995)} is VALID [2022-04-15 12:28:02,401 INFO L290 TraceCheckUtils]: 86: Hoare triple {123716#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123716#(< main_~i~0 994)} is VALID [2022-04-15 12:28:02,401 INFO L290 TraceCheckUtils]: 85: Hoare triple {123723#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123716#(< main_~i~0 994)} is VALID [2022-04-15 12:28:02,401 INFO L290 TraceCheckUtils]: 84: Hoare triple {123723#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123723#(< main_~i~0 993)} is VALID [2022-04-15 12:28:02,402 INFO L290 TraceCheckUtils]: 83: Hoare triple {123730#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123723#(< main_~i~0 993)} is VALID [2022-04-15 12:28:02,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {123730#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123730#(< main_~i~0 992)} is VALID [2022-04-15 12:28:02,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {123737#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123730#(< main_~i~0 992)} is VALID [2022-04-15 12:28:02,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {123737#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123737#(< main_~i~0 991)} is VALID [2022-04-15 12:28:02,403 INFO L290 TraceCheckUtils]: 79: Hoare triple {123744#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123737#(< main_~i~0 991)} is VALID [2022-04-15 12:28:02,403 INFO L290 TraceCheckUtils]: 78: Hoare triple {123744#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123744#(< main_~i~0 990)} is VALID [2022-04-15 12:28:02,403 INFO L290 TraceCheckUtils]: 77: Hoare triple {123751#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123744#(< main_~i~0 990)} is VALID [2022-04-15 12:28:02,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {123751#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123751#(< main_~i~0 989)} is VALID [2022-04-15 12:28:02,404 INFO L290 TraceCheckUtils]: 75: Hoare triple {123758#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123751#(< main_~i~0 989)} is VALID [2022-04-15 12:28:02,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {123758#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123758#(< main_~i~0 988)} is VALID [2022-04-15 12:28:02,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {123765#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123758#(< main_~i~0 988)} is VALID [2022-04-15 12:28:02,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {123765#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123765#(< main_~i~0 987)} is VALID [2022-04-15 12:28:02,405 INFO L290 TraceCheckUtils]: 71: Hoare triple {123772#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123765#(< main_~i~0 987)} is VALID [2022-04-15 12:28:02,406 INFO L290 TraceCheckUtils]: 70: Hoare triple {123772#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123772#(< main_~i~0 986)} is VALID [2022-04-15 12:28:02,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {123779#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123772#(< main_~i~0 986)} is VALID [2022-04-15 12:28:02,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {123779#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123779#(< main_~i~0 985)} is VALID [2022-04-15 12:28:02,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {123786#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123779#(< main_~i~0 985)} is VALID [2022-04-15 12:28:02,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {123786#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123786#(< main_~i~0 984)} is VALID [2022-04-15 12:28:02,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {123793#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123786#(< main_~i~0 984)} is VALID [2022-04-15 12:28:02,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {123793#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123793#(< main_~i~0 983)} is VALID [2022-04-15 12:28:02,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {123800#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123793#(< main_~i~0 983)} is VALID [2022-04-15 12:28:02,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {123800#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123800#(< main_~i~0 982)} is VALID [2022-04-15 12:28:02,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {123807#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123800#(< main_~i~0 982)} is VALID [2022-04-15 12:28:02,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {123807#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123807#(< main_~i~0 981)} is VALID [2022-04-15 12:28:02,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {123814#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123807#(< main_~i~0 981)} is VALID [2022-04-15 12:28:02,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {123814#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123814#(< main_~i~0 980)} is VALID [2022-04-15 12:28:02,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {123821#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123814#(< main_~i~0 980)} is VALID [2022-04-15 12:28:02,410 INFO L290 TraceCheckUtils]: 56: Hoare triple {123821#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123821#(< main_~i~0 979)} is VALID [2022-04-15 12:28:02,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {123828#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123821#(< main_~i~0 979)} is VALID [2022-04-15 12:28:02,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {123828#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123828#(< main_~i~0 978)} is VALID [2022-04-15 12:28:02,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {123835#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123828#(< main_~i~0 978)} is VALID [2022-04-15 12:28:02,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {123835#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123835#(< main_~i~0 977)} is VALID [2022-04-15 12:28:02,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {123842#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123835#(< main_~i~0 977)} is VALID [2022-04-15 12:28:02,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {123842#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123842#(< main_~i~0 976)} is VALID [2022-04-15 12:28:02,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {123849#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123842#(< main_~i~0 976)} is VALID [2022-04-15 12:28:02,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {123849#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123849#(< main_~i~0 975)} is VALID [2022-04-15 12:28:02,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {123856#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123849#(< main_~i~0 975)} is VALID [2022-04-15 12:28:02,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {123856#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123856#(< main_~i~0 974)} is VALID [2022-04-15 12:28:02,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {123863#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123856#(< main_~i~0 974)} is VALID [2022-04-15 12:28:02,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {123863#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123863#(< main_~i~0 973)} is VALID [2022-04-15 12:28:02,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {123870#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123863#(< main_~i~0 973)} is VALID [2022-04-15 12:28:02,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {123870#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123870#(< main_~i~0 972)} is VALID [2022-04-15 12:28:02,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {123877#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123870#(< main_~i~0 972)} is VALID [2022-04-15 12:28:02,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {123877#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123877#(< main_~i~0 971)} is VALID [2022-04-15 12:28:02,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {123884#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123877#(< main_~i~0 971)} is VALID [2022-04-15 12:28:02,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {123884#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123884#(< main_~i~0 970)} is VALID [2022-04-15 12:28:02,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {123891#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123884#(< main_~i~0 970)} is VALID [2022-04-15 12:28:02,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {123891#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123891#(< main_~i~0 969)} is VALID [2022-04-15 12:28:02,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {123898#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123891#(< main_~i~0 969)} is VALID [2022-04-15 12:28:02,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {123898#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123898#(< main_~i~0 968)} is VALID [2022-04-15 12:28:02,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {123905#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123898#(< main_~i~0 968)} is VALID [2022-04-15 12:28:02,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {123905#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123905#(< main_~i~0 967)} is VALID [2022-04-15 12:28:02,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {123912#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123905#(< main_~i~0 967)} is VALID [2022-04-15 12:28:02,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {123912#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123912#(< main_~i~0 966)} is VALID [2022-04-15 12:28:02,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {123919#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123912#(< main_~i~0 966)} is VALID [2022-04-15 12:28:02,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {123919#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123919#(< main_~i~0 965)} is VALID [2022-04-15 12:28:02,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {123926#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123919#(< main_~i~0 965)} is VALID [2022-04-15 12:28:02,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {123926#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123926#(< main_~i~0 964)} is VALID [2022-04-15 12:28:02,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {123933#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123926#(< main_~i~0 964)} is VALID [2022-04-15 12:28:02,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {123933#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123933#(< main_~i~0 963)} is VALID [2022-04-15 12:28:02,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {123940#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123933#(< main_~i~0 963)} is VALID [2022-04-15 12:28:02,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {123940#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123940#(< main_~i~0 962)} is VALID [2022-04-15 12:28:02,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {123947#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123940#(< main_~i~0 962)} is VALID [2022-04-15 12:28:02,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {123947#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123947#(< main_~i~0 961)} is VALID [2022-04-15 12:28:02,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {123954#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123947#(< main_~i~0 961)} is VALID [2022-04-15 12:28:02,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {123954#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123954#(< main_~i~0 960)} is VALID [2022-04-15 12:28:02,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {123961#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123954#(< main_~i~0 960)} is VALID [2022-04-15 12:28:02,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {123961#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123961#(< main_~i~0 959)} is VALID [2022-04-15 12:28:02,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {123968#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123961#(< main_~i~0 959)} is VALID [2022-04-15 12:28:02,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {123968#(< main_~i~0 958)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123968#(< main_~i~0 958)} is VALID [2022-04-15 12:28:02,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {123975#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123968#(< main_~i~0 958)} is VALID [2022-04-15 12:28:02,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {123975#(< main_~i~0 957)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123975#(< main_~i~0 957)} is VALID [2022-04-15 12:28:02,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {123982#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123975#(< main_~i~0 957)} is VALID [2022-04-15 12:28:02,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {123982#(< main_~i~0 956)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123982#(< main_~i~0 956)} is VALID [2022-04-15 12:28:02,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {123989#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123982#(< main_~i~0 956)} is VALID [2022-04-15 12:28:02,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {123989#(< main_~i~0 955)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123989#(< main_~i~0 955)} is VALID [2022-04-15 12:28:02,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {123996#(< main_~i~0 954)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123989#(< main_~i~0 955)} is VALID [2022-04-15 12:28:02,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {123996#(< main_~i~0 954)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123996#(< main_~i~0 954)} is VALID [2022-04-15 12:28:02,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {122926#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {123996#(< main_~i~0 954)} is VALID [2022-04-15 12:28:02,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {122926#true} call #t~ret5 := main(); {122926#true} is VALID [2022-04-15 12:28:02,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 12:28:02,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 12:28:02,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {122926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {122926#true} is VALID [2022-04-15 12:28:02,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {122926#true} call ULTIMATE.init(); {122926#true} is VALID [2022-04-15 12:28:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4768 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 12:28:02,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501683886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:28:02,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:28:02,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 72, 72] total 144 [2022-04-15 12:28:02,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:28:02,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562342677] [2022-04-15 12:28:02,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562342677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:28:02,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:28:02,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-15 12:28:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188938120] [2022-04-15 12:28:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:28:02,429 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-15 12:28:02,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:28:02,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:28:02,525 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-15 12:28:02,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-15 12:28:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:28:02,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-15 12:28:02,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10155, Invalid=10437, Unknown=0, NotChecked=0, Total=20592 [2022-04-15 12:28:02,527 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 73 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)